Three optimisations for sharing
| Autor: | Andy King, Jacob M. Howe |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Programming Languages Correctness Unification D.1.6 Computer science Distributed computing f.3.2 Linearity Tracing Abstract interpretation Theoretical Computer Science Computational Theory and Mathematics Artificial Intelligence Hardware and Architecture Pruning (decision trees) Software Scope (computer science) Programming Languages (cs.PL) |
| Zdroj: | Theory and Practice of Logic Programming. 3:243-257 |
| ISSN: | 1475-3081 1471-0684 |
| DOI: | 10.1017/s1471068402001497 |
| Popis: | 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 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. Comment: To appear in Theiry and Practice of Logic Programming |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|