Back to Search
Start Over
Set-sharing is redundant for pair-sharing
- Source :
-
Theoretical Computer Science . Apr2002, Vol. 277 Issue 1/2, p3. 44p. - Publication Year :
- 2002
-
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. [Copyright &y& Elsevier]
- Subjects :
- *LOGIC programming
*ELECTRONIC data processing
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 277
- Issue :
- 1/2
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 7792998
- Full Text :
- https://doi.org/10.1016/S0304-3975(00)00312-1