Home |
Personal Info |
Papers |
Teaching |
Links |
Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation
Roberto Bagnara
Dipartimento di Matematica e Informatica
Università di Parma
Parco Area delle Scienze 53/A
I-43124 Parma
Italy
Enea Zaffanella
Dipartimento di Matematica e Informatica
Università di Parma
Parco Area delle Scienze 53/A
I-43124 Parma
Italy
Patricia M. Hill
School of Computer Studies
University of Leeds
Leeds, LS2 9JT
United Kingdom
Abstract:
Sharing, an abstract domain developed by D.~Jacobs and A.~Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of techniques, such as the integration of Sharing with freeness and linearity information, can significantly improve the precision of the analysis. However, a number of other proposals for refined domain combinations have been circulating for years. One feature that is common to these proposals is that they do not seem to have undergone a thorough experimental evaluation even with respect to the expected precision gains. In this paper we experimentally evaluate: helping Sharing with the definitely ground variables found using Pos, the domain of positive Boolean formulas; the incorporation of explicit structural information; a full implementation of the reduced product of Sharing and Pos; the issue of reordering the bindings in the computation of the abstract mgu; an original proposal for the addition of a new mode recording the set of variables that are deemed to be ground or free; a refined way of using linearity to improve the analysis; the recovery of hidden information in the combination of Sharing with freeness information. Finally, we discuss the issue of whether tracking compoundness allows the computation of more sharing information.Keywords: Abstract Interpretation; Logic Programming; Sharing Analysis; Experimental Evaluation.
Dedication:
This paper is dedicated to all those who take a visible stance in favor of scientific integrity. In particular, it is dedicated to David Goodstein, for ``Conduct and Misconduct in Science''; to John Koza, for ``A Peer Review of the Peer Reviewing Process of the International Machine Learning Conference''; to Krzysztof Apt, Veronica Dahl and Catuscia Palamidessi for the Association for Logic Programming's ``Code of Conduct for Referees''; and to the large number of honest and thorough referees who do so much to help maintain and improve the quality of all publications.
Available: PDF, 300 DPI, 600 DPI, and 1200 DPI PostScript, DVI, BibTeX entry.
[Page last updated on January 18, 2013, 17:41:50.]
bagnara@cs.unipr.it
Home | Personal | Papers | Teaching | Links