Location of Repository

Enhanced sharing analysis techniques: a comprehensive evaluation

By R. Bagnara, E. Zeffanella and P.M. Hill

Abstract

Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic\ud programs, derives useful aliasing information. It is well-known that a commonly used core\ud of techniques, such as the integration of Sharing with freeness and linearity information, can\ud significantly improve the precision of the analysis. However, a number of other proposals for\ud refined domain combinations have been circulating for years. One feature that is common\ud to these proposals is that they do not seem to have undergone a thorough experimental\ud evaluation even with respect to the expected precision gains.\ud \ud In this paper we experimentally\ud evaluate: helping Sharing with the definitely ground variables found using Pos, the domain\ud of positive Boolean formulas; the incorporation of explicit structural information; a full\ud implementation of the reduced product of Sharing and Pos; the issue of reordering the\ud bindings in the computation of the abstract mgu; an original proposal for the addition of\ud a new mode recording the set of variables that are deemed to be ground or free; a refined\ud way of using linearity to improve the analysis; the recovery of hidden information in the\ud combination of Sharing with freeness information. Finally, we discuss the issue of whether\ud tracking compoundness allows the computation of more sharing information

Publisher: Cambridge University Press
Year: 2005
OAI identifier: oai:eprints.whiterose.ac.uk:1207

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.