Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-25T04:25:36.441Z Has data issue: false hasContentIssue false
  • English
  • Français

Three optimisations for sharing

Published online by Cambridge University Press:  10 March 2003

JACOB M. HOWE  and
ANDY KING
JACOB M. HOWE
Affiliation:
Department of Computing, City University, London EC1V OHB, UK (e-mail: [email protected])
ANDY KING
Affiliation:
Computing Laboratory, University of Kent at Canterbury, Canterbury CT2 7NF, UK (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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 optimisations for tracing sharing in combination with freeness and linearity. A novel connection between equations and sharing abstractions is used to establish correctness of these optimisations even in the presence of rational trees. A method for pruning intermediate sharing abstractions to improve efficiency is also proposed. The optimisations are lightweight and therefore some, if not all, of these optimisations will be of interest to the implementor.

Keywords

abstract interpretationsharing analysisfreenesslinearity and rational trees
Type
Technical Note
Information
Theory and Practice of Logic Programming , Volume 3 , Issue 2 , March 2003 , pp. 243 - 257
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)