Lazy Set-Sharing Analysis: 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006. Proceedings

Li, Xuan and King, Andy and Lu, Lunjin (2006) Lazy Set-Sharing Analysis: 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006. Proceedings. In: Wadler, Philip and Hagiya, Masimi, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 3945 . Springer, pp. 177-191. ISBN 978-3-540-33438-5. (doi:10.1007/11737414_13)

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
DOI/Identification number: 10.1007/11737414_13
Subjects: A General Works
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 12 Dec 2013 23:16 UTC
Last Modified: 29 May 2019 11:40 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/37602 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year