Li, Xuan and King, Andy and Lu, Lunjin (2006) Lazy Set-Sharing Analysis. In: Wadler, Philip and Hagiya, Masimi, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 3945 . Springer Berlin / Heidelberg, pp. 177-191. ISBN 978-3-540-33438-5.
| Postscript | ||
|
Download (319Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
| Official URL http://dx.doi.org/10.1007/11737414 |
||
Abstract
Sharing analysis is widely deployed in the optimisation, specialisation and parallelisation of logic programs. Each abstract unification operation over the classic Jacobs and Langen domain involves the calculation of a closure operation that has exponential worst-case complexity. This paper explores a new tactic for improving performance: laziness. The idea is to compute partial sharing information eagerly and recover full sharing information lazily. The net result is an analysis that runs in a fraction of the time of the classic analysis and yet has comparable precision.
| Item Type: | Book section |
|---|---|
| Uncontrolled keywords: | abstract interpretation, logic programming, sharing analysis |
| 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 18:04 |
| Last Modified: | 06 Sep 2011 01:34 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/14492 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
