(Enter summary)
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... (Update)
Cited by: More
Set-Sharing is not always redundant for Pair-Sharing - Bueno, Banda
(Correct)
An Algebraic Approach to Sharing Analysis of Logic Programs - Codish, Lagoon, Bueno (1998)
(Correct)
Optimality in Goal-dependent Analysis of Sharing - Amato, Scozzari (2002)
(Correct)
Similar documents (at the sentence level): More
80.0%: Sharing Revisited - Bagnara, Hill, Zaffanella (1997)
(Correct)
20.5%: Set-Sharing is Redundant for Pair-Sharing - Bagnara, Hill, Zaffanella (1997)
(Correct)
6.4%: The Correctness of Set-Sharing - Hill, Bagnara, Zaffanella (1998)
(Correct)
Active bibliography (related documents): More All
0.4: Declarative Interface for Constraint Solving - Hill
(Correct)
0.3: Interfaces to Interaction Data - Duke-Williams (1998)
(Correct)
0.2: A Correct, Precise and Efficient Integration of.. - Hill, Zaffanella.. (2001)
(Correct)
Similar documents based on text: More All
0.5: Decomposing Non-Redundant Sharing by Complementation - Zaffanella, Hill, Bagnara (2001)
(Correct)
0.4: Widening Sharing - Zaffanella, Bagnara, Hill
(Correct)
0.3: Enhancing Sharing for Precision - Bagnara, Zaffanella, Hill (1999)
(Correct)
Related documents from co-citation: More All
41: The Correctness of Set-Sharing
- Hill, Bagnara et al. - 1998
41: Static analysis of logic programs for independent ANDparallelism (context) - Jacobs, Langen - 1992
33: Data-Flow Analysis for Constraint Logic-Based Languages (context) - Bagnara - 1997
BibTeX entry: (Update)
R. Bagnara, P. Hill, and E. Zaffanella. Setsharing is redundant for pair-sharing. In Proceedings of the Static Analysis Symposium. Springer-Verlag, 1997. Tech Report 97.19 at http://www.scs.leeds.ac.uk/services/reports. http://citeseer.ist.psu.edu/article/bagnara97setsharing.html More
@article{ bagnara02setsharing,
author = "Roberto Bagnara and Patricia M. Hill and Enea Zaffanella",
title = "Set-sharing is redundant for pair-sharing",
journal = "Theoretical Computer Science",
volume = "277",
number = "1-2",
pages = "3-46",
year = "2002",
url = "citeseer.ist.psu.edu/article/bagnara97setsharing.html" }
Citations (may not include all citations):
88
Static analysis of logic programs for independent AND parall.. (context) - Jacobs, Langen - 1992
77
Combinations of abstract domains for logic programming
- Cortesi, Le Charlier et al. - 1994
59
Combined determination of sharing and freeness of program va..
- Muthukumar, Hermenegildo - 1991
55
Data-Flow Analysis for Constraint Logic-Based Languages (context) - Bagnara - 1997
49
Accurate and efficient approximation of variable aliasing in.. (context) - Jacobs, Langen - 1989
42
An application of abstract interpretation of logic programs:.. (context) - Sndergaard - 1986
32
A synergistic analysis for sharing and groundness which trac..
- King - 1994
29
sharing and freeness (context) - King, Soper - 1994
27
Conceptual and software support for abstract domain design: .. (context) - Cortesi, Le Charlier et al. - 1993
23
linearity and correctness --- All at once (context) - Bruynooghe, Codish et al. - 1993
22
Static Analysis for Independent And-Parallelism in Logic Pro.. (context) - Langen - 1990
14
Comparison and design of abstract domains for sharing analys.. (context) - Cortesi, Fil'e - 1993
12
Dipartimento di Matematica (context) - Fil'e, Theta et al. - 1994
3
University of Leeds (context) - Computer - 1997
3
Sharing revisited
- Bagnara, Hill et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.unipr.it/~bagnara/Papers/PostScript/600dpi/linkall.html): More
Straight ROBDDS are not the Best for Pos - Bagnara
(Correct)
Soundness, Idempotence and Commutativity of Set-Sharing - Hill, Bagnara, Zaffanella
(Correct)
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC