Hill, P.M., Zaffanella, E. and Bagnara, R. (2004) 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, 4 (3). pp. 289-323. ISSN 1471-0684Full text available as:
Available under licence : See the attached licence file.
It is well known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper, we present a novel combination of set-sharing with freeness and linearity information, which is characterized by an improved abstract unification operator. We provide a new abstraction function and prove the correctness of the analysis for both the finite tree and the rational tree cases.
Moreover, we show that the same notion of redundant information as identified in Bagnara et al. (2000) and Zaffanella et al. (2002) also applies to this abstract domain combination: this allows for the implementation of an abstract unification operator running in polynomial time and achieving the same precision on all the considered observable properties.
|Copyright, Publisher and Additional Information:||© 2004 Cambridge University Press|
|Keywords:||abstract interpretation, logic programming, abstract unification, rational trees, set-sharing, freeness, linearity|
|Institution:||The University of Leeds|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)|
|Depositing User:||Repository Assistant|
|Date Deposited:||18 May 2006|
|Last Modified:||08 Jun 2014 06:16|
|Publisher:||Cambridge University Press|