Three optimisations for sharing

Authors:
Jacob M. Howe;Andy King
Affiliations:
Department of Computing, City University, London EC1V OHB, UK (e-mail: sjacob@soi.city.ac.uk);Computing Laboratory, University of Kent at Canterbury, Canterbury CT2 7NF, UK (e-mail: a.m.king@ukc.ac.uk)
Venue:
Theory and Practice of Logic Programming
Year:
2003

Citing 6
Cited 4

Unification revisited

Foundations of deductive databases and logic programming
Compile-time derivation of variable dependency using abstract interpretation

Journal of Logic Programming
Sharing and groundness dependencies in logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Enhanced sharing analysis techniques: a comprehensive evaluation

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Advanced techniques for approximating variable aliasing in logic programs

Advanced techniques for approximating variable aliasing in logic programs
Soundness, idempotence and commutativity of set-sharing

Theory and Practice of Logic Programming

A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages

Theory and Practice of Logic Programming
Optimality in goal-dependent analysis of sharing

Theory and Practice of Logic Programming
A general framework for variable aliasing: towards optimal operators for sharing properties

LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Lazy set-sharing analysis

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.