Three Optimisations for Sharing

Howe, J.M. and King, Andy (2001) Three Optimisations for Sharing. Technical report. UKC, University of Kent at Canterbury (Unpublished)

Postscript
Download (372Kb)	Preview
PDF
Download (246Kb)	Preview

Abstract

In order to improve precision and efficiency sharing analysis should track both freeness and linearity. The abstract unification algorithms for these combined domains are suboptimal, hence there is scope for improving precision. This paper proposes three lightweight optimisations for tracing sharing in combination with freeness and linearity, and proves their correctness. Correctness is established in the presence of rational trees in terms of a novel abstraction operator. A method for pruning intermediate sharing abstractions is also proposed. The cost of these optimisations ranges from zero to linear (even before the efficiency gains that follow from improved precision), therefore some, if not all, of these optimisations will be of interest to an implementor.

Item Type:	Monograph (Technical report)
Additional information:	Accepted to appear in Theory and Practice of Logic Programming subject minor corrections.
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	24 Nov 2008 17:59
Last Modified:	25 Jun 2012 14:17
Resource URI:	http://kar.kent.ac.uk/id/eprint/13580 (The current URI for this page, for reference purposes)

• Depositors only (login required):