www.elsevier.com/locate/tcs 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 3rst time, whether this domain is over-complex for pair-sharing analysis. We show that the answer is yes. By de3ning an equivalence relation uni3cation 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