Collapsing Closures

Li, Xuan and King, Andy and Lu, Lunjin (2006) Collapsing Closures. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer Berlin / Heidelberg, pp. 148-162. ISBN 978-3-540-36635-5.

Postscript
Download (336Kb)	Preview
Official URL http://dx.doi.org/10.1007/11799573

Abstract

A description in the Jacobs and Langen domain is a set of sharing groups where each sharing group is a set of program variables. The presence of a sharing group in a description indicates that all the variables in the group can be bound to terms that contain a common variable. The expressiveness of the domain, alas, is compromised by its intractability. Not only are descriptions potentially exponential in size, but abstract unification is formulated in terms of an operation, called closure under union, that is also exponential. This paper shows how abstract unification can be reformulated so that closures can be collapsed in two senses. Firstly, one closure operation can be folded into another so as to reduce the total number of closures that need to be computed. Secondly, the remaining closures can be applied to smaller descriptions. Therefore, although the operation remains exponential, the overhead of closure calculation is reduced. Experimental evaluation suggests that the cost of analysis can be substantially reduced by collapsing closures.

Item Type:	Book section
Uncontrolled keywords:	sharing analysis, abstract interpretation
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:03
Last Modified:	06 Sep 2011 01:33
Resource URI:	http://kar.kent.ac.uk/id/eprint/14438 (The current URI for this page, for reference purposes)

• Depositors only (login required):