|
Set-Sharing is Redundant for Pair-Sharing (TCS)[Page last updated on "gennaio 13, 2005, 15:31:42".]Roberto Bagnara, Patricia M. Hill, and Enea Zaffanella AbstractAlthough 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, and BibTeX entry. |
||||||
enea.zaffanella@unipr.it |
| Home | Personal Info | Research | Papers | Teaching | About |