Home |
Personal Info |
Papers |
Teaching |
Links |
Set-Sharing is Redundant for Pair-Sharing
Roberto Bagnara
School of Computer Studies
University of Leeds
Leeds, LS2 9JT
United Kingdom
Patricia M. Hill
School of Computer Studies
University of Leeds
Leeds, LS2 9JT
United Kingdom
Enea Zaffanella
Servizio IX Automazione, Università di Modena
and Dipartimento di Informatica, Università di Pisa
Italy
Abstract:
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In this paper, we question, apparently for the first time, whether this domain is over-complex for pair-sharing analysis. We show that the answer is yes. By defining an equivalence relation over the set-sharing domain we obtain a simpler domain, reducing the complexity of the abstract unification procedure. We present experimental results showing that, in practice, our domain compares favorably with the set-sharing one over a wide range of benchmark and real programs.
Available: PDF, 300 DPI, 600 DPI, and 1200 DPI PostScript, DVI, BibTeX entry.
[Page last updated on December 21, 2001, 10:21:30.]
bagnara@cs.unipr.it
Home | Personal | Papers | Teaching | Links