Patricia M. Hill, Enea Zaffanella, Roberto Bagnara  Home/Search
Context
Related
Links: ACM DBLP | cs.unipr.it/~bagnar...Q273600DPI.ps.gz cs.unipr.it/~bagnara/Papers/...Q273.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.unipr.it/~bagnara/Pa...linkall (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is well-known that freeness and linearity information positively interact with aliasing information, therefore allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper we present a novel combination of set-sharing with freeness and linearity information, which is characterized by an improved abstract unification operator. We provide a new abstraction function and prove the correctness of the analysis for both the finite tree and... (Update)
Similar documents (at the sentence level): More
64.0%: A Correct, Precise and Efficient Integration of Set-Sharing.. - Hill, al. (Correct)
9.0%: Soundness, Idempotence and Commutativity of Set-Sharing - Hill, Bagnara, Zaffanella (Correct)
7.0%: Boolean Functions for Finite-Tree Dependencies - Bagnara, Zaffanella, Gori (2001) (Correct)
Active bibliography (related documents): More All
0.8: Set-Sharing is Redundant for Pair-Sharing - Bagnara, Hill, al. (1997) (Correct)
0.8: An Efficient and Precise Finite-Tree Analysis for.. - Bagnara, Zaffanella, .. (Correct)
0.6: Enhanced Sharing Analysis Techniques: A Comprehensive.. - Bagnara, Zaffanella, Hill (2000) (Correct)
BibTeX entry: (Update)
@misc{ hill-correct,
author = "Patricia M. Hill and Enea Zaffanella and Roberto Bagnara",
title = "A Correct, Precise and Efficient Integration of Set-Sharing, Freeness and
Linearity for the Analysis of Finite and Rational Tree Languages",
url = "citeseer.ist.psu.edu/article/hill01correct.html" }
Citations (may not include all citations):815 Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977 DBLP
759 Negation as failure (context) - Clark - 1978 ACM DBLP
118 Complete axiomatizations of the algebras of finite (context) - Maher - 1988
105 Compile-time derivation of variable dependency using abstrac.. - Muthukumar, Hermenegildo - 1992 ACM DBLP
94 Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984 DBLP
72 Prolog and infinite trees (context) - Colmerauer - 1982
59 Set-sharing is redundant for pair-sharing - Bagnara, Hill et al. - 2002 ACM DBLP
59 Combined determination of sharing and freeness of program va.. - Muthukumar, Hermenegildo DBLP
59 Set-sharing is redundant for pairsharing - Bagnara, Hill et al. - 1997
55 Data-Flow Analysis for Constraint Logic-Based Languages (context) - Bagnara - 1997
45 Improving abstract interpretations by combining domains (context) - Codish, Mulkers et al. ACM DBLP
45 Improving abstract interpretations by combining domains (context) - Codish, Mulkers et al. - 1995 ACM DBLP
42 An application of abstract interpretation of logic programs:.. (context) - Sndergaard ACM DBLP
32 The correctness of set-sharing - Hill, Bagnara et al. - 1998 ACM DBLP
32 A synergistic analysis for sharing and groundness which trac.. - King - 1994
29 sharing and freeness (context) - King, Soper - 1994
27 Sharing is optimal (context) - Cortesi, File - 1999 DBLP
26 Derivation and safety of an abstract unification algorithm f.. (context) - Codish, Dams et al. DBLP
24 Enhanced sharing analysis techniques: A comprehensive evalua.. - Bagnara, Za et al. - 2000 DBLP
23 linearity and correctness --- All at once (context) - Bruynooghe, Codish et al.
20 cient approximation of variable aliasing in logic programs (context) - Jacobs, Langen - 1989
18 Freeness analysis for logic programs --- and correctness (context) - Codish, Dams et al.
17 Decomposing non-redundant sharing by complementation - Za, Hill et al. - 2002 ACM DBLP
17 Decomposing non-redundant sharing by complementation - Za, Hill et al. - 1999 ACM DBLP
16 Pair-sharing over rational trees (context) - King - 2000 DBLP
14 Abstract unification for a composite domain deriving sharing.. (context) - Bruynooghe, Codish et al. - 1994
14 Aliasing and groundness analysis of logic programs through a.. (context) - Hans, Winkler - 1992
14 Prolog-II as an instance of the logic programming scheme (context) - Ja, J-L et al. - 1987
13 Advanced Techniques for Approximating Variable Aliasing in L.. (context) - Langen - 1990 ACM
12 Dipartimento di Matematica (context) - File, Simple et al. - 1994
11 Department of Computer Science (context) - Bruynooghe, Codish et al. - 1994
10 Also available SIC Dissertation Serie SICD SE (context) - Constraints, The et al. - 1994
8 Theory and Practice of Logic Programming (context) - Hill, Bagnara et al.
7 the design of a correct freeness analysis for logic programs - Codish, Dams et al. - 1996
6 ciency in the Sharing Analysis of Real Logic Languages (context) - Za, Correctness - 2001
6 A remark on infinite matching vs infinite unification (context) - Intrigila, Zilli - 1996 DBLP
3 Logic Programming: Proceedings of the Eighth International C.. (context) - Furukawa - 1991
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