Set-sharing is redundant for pair-sharing

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. s: Logic Programming; Data-flow Analysis; Abstract Interpretation; Sharing Analysis. This work is a revised and extended version of [3]. 1 Most of the work of R. Bagnara has been conducted while the author was at the School of Computer Studies, University of Leeds, Leeds, LS2 9JT, U.K. His work has been supported by EPSRC under grant GR/L19515. Prepr...

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
• Keywords: Abstract Unification Procedure, Analysis, Sharing, TCS 2002, Theoretical Computer Science