See this document in CiteSeerX!

Set-Sharing is Redundant for Pair-Sharing (1997)  (Make Corrections)  (59 citations)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Theoretical Computer Science



  Home/Search   Context   Related

 
View or download:
cs.unipr.it/~bagna...TCS01600DPI.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.unipr.it/~bagnara/Pa...linkall (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(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):
7.6%:   Set-Sharing is Redundant for Pair-Sharing - Bagnara, Hill, Zaffanella (1997)   (Correct)
6.3%:   Sharing Revisited - Bagnara, Hill, Zaffanella (1997)   (Correct)
5.0%:   Decomposing Non-Redundant Sharing by Complementation - Zaffanella, Hill, Bagnara   (Correct)

Active bibliography (related documents):   More   All
0.7:   A Correct, Precise and Efficient Integration of.. - Hill, Zaffanella.. (2001)   (Correct)
0.7:   Enhanced Sharing Analysis Techniques: A Comprehensive.. - Bagnara, Zaffanella, Hill (2000)   (Correct)
0.6:   Widening Sharing - Zaffanella, Bagnara, Hill   (Correct)

Similar documents based on text:   More   All
0.9:   Widening Operators for Powerset Domains - Bagnara, Hill, Zaffanella (2004)   (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):
245   A Compendium of Continuous Lattices (context) - Gierz, Hofmann et al. - 1980
193   Abstract interpretation: A unied lattice model for static an.. (context) - Cousot, Cousot - 1977
142   Abstract interpretation frameworks (context) - Cousot, Cousot - 1992
105   Compile-time derivation of variable dependency using abstrac.. - Muthukumar, Hermenegildo - 1992
88   Static analysis of logic programs for independent AND parall.. (context) - Jacobs, Langen - 1992
83   Prolog and its performance: Exploiting independent And-Paral.. (context) - Hermenegildo, Greene - 1990
79   Static inference of modes and data dependencies in logic pro.. - Debray - 1989
77   Combinations of abstract domains for logic programming - Cortesi, Le Charlier et al. - 1994
72   Prop revisited: Propositional formula as abstract domain for.. (context) - Cortesi, Fil et al. - 1991
70   A semantics-based framework for the abstract interpretation .. (context) - Jones, ndergaard - 1987
62   Some global optimizations for a Prolog compiler (context) - Mellish - 1985
59   Combined determination of sharing and freeness of program va.. - Muthukumar, Hermenegildo
59   Set-sharing is redundant for pairsharing - Bagnara, Hill et al.
58   Two classes of Boolean functions for dependency analysis - Armstrong, Marriott et al. - 1998
55   Data-Flow Analysis for Constraint Logic-Based Languages (context) - Bagnara - 1997
45   Improving abstract interpretations by combining domains (context) - Codish, Mulkers et al. - 1995
42   Enumeration of success patterns in logic programs (context) - Sato, Tamaki - 1984
41   Analysis of constraint logic programs (context) - Marriott, ndergaard - 1990
41   High Performance Prolog Implementation (context) - Taylor - 1991
38   Generalized semantics and abstract interpretation for constr.. - Giacobazzi, Debray et al. - 1995
32   The correctness of set-sharing - Hill, Bagnara et al. - 1998
32   A synergistic analysis for sharing and groundness which trac.. - King - 1994
32   The correctness of set-sharing - Hill, Bagnara et al. - 1998
31   An application of abstract interpretation of logic programs:.. (context) - ndergaard - 1986
30   AND-parallelism of logic programs based on a static data dep.. (context) - Chang, Despain et al. - 1985
29   sharing and freeness (context) - King, Soper - 1994
27   Conceptual and software support for abstract domain design: .. (context) - Cortesi, Le Charlier et al. - 1993
22   Static Analysis for Independent And-Parallelism in Logic Pro.. (context) - Langen - 1990
22   The closure operators of a lattice (context) - Ward - 1942
20   The occur-check problem in Prolog (context) - Plaisted - 1984
19   The quotient of an abstract interpretation for comparing sta.. (context) - Cortesi, Fil et al. - 1998
18   abstractions and constraints (context) - Codognet, Fil et al. - 1992
18   Comparison of abstract interpretations (context) - Cortesi, Fil et al. - 1992
17   A comparison of three occur check analysers - Crnogorac, Kelly et al.
14   Comparison and design of abstract domains for sharing analys.. (context) - Cortesi, Fil - 1993
13   An algebraic approach to sharing analysis of logic programs - Codish, Lagoon et al.
13   Complementation of abstract domains made easy (context) - Fil, Ranzato - 1996
12   Dipartimento di Matematica (context) - Fil, Share et al. - 1994
12   Accurate and ecient approximation of variable aliasing in lo.. (context) - Jacobs, Langen - 1989
11   Department of Computer Science (context) - Bruynooghe, Codish et al. - 1994
10   On describing success patterns of logic programs (context) - Marriott, ndergaard - 1988
10   Completeness in abstract interpretation: a domain perspectiv.. (context) - Giacobazzi, Ranzato - 1997
8   ACM Transactions on Programming Languages and Systems (context) - Cortesi, Fil et al. - 1997
6   Complete abstract interpretations made constructive (context) - Giacobazzi, Ranzato et al. - 1998
6   Ecient and precise sharing domains for logic programs (context) - Fecht - 1996
5   A freeness and sharing analysis of logic programs based on a.. - Bruynooghe, Demoen et al.
5   High Performance Execution of Prolog Programs Based on a Sta.. (context) - Chang - 1986
4   Derivation and safety of an abstract unication algorithm for.. (context) - Codish, Dams et al.
4   Dipartimento di Matematica (context) - Za, Bagnara et al. - 1999
3   Logic Programming: Proceedings of the Eighth International C.. (context) - Furukawa - 1991
2   Global ow analysis as a practical compilation tool (context) - Hermenegildo, Warren et al. - 1992
2   Static Analysis: Proceedings of the 3rd International Sympos.. (context) - Cousot, Schmidt - 1996
2   Static Analysis: Proceedings of the 4th International Sympos.. (context) - Van Hentenryck - 1997
1   Parallel Unication Scheduling in Prolog (context) - Citrin - 1988



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
Set-Sharing is Redundant for Pair-Sharing - Bagnara, Hill, Zaffanella (1997)   (Correct)
Straight ROBDDS are not the Best for Pos - Bagnara   (Correct)
Soundness, Idempotence and Commutativity of Set-Sharing - Hill, Bagnara, Zaffanella   (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