Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill  Home/Search
Context Related
| cs.unipr.it/~bagna...1BZGH600DPI.ps.gz cs.unipr.it/~bagnara/Pa...AGP01BZGH.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: Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees that allow for increased expressivity and faster unification. Unfortunately, the use of infinite rational trees has problems. For instance, many of the built-in and library predicates are ill-defined for such trees and need to be supplemented by run-time checks whose cost may be significant. In a companion paper [3] we have proposed a data-flow analysis ... (Update)
Context of citations to this paper: More
.... by forward computations (since they proceed by consistently instantiating program variables) Following the intuition outlined above, in [4] we have studied a domain, whose carrier is the set of all Boolean functions, for representing and propagating finiteness dependencies....
Cited by: More
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (Correct)
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (Correct)
Similar documents (at the sentence level):
39.7%: An Efficient and Precise Finite-Tree Analysis for.. - Bagnara, Zaffanella, .. (Correct)
16.2%: Boolean Functions for Finite-Tree Dependencies - Bagnara, Zaffanella, Gori (2001) (Correct)
Active bibliography (related documents): More All
0.2: Semantic-Based Software Support for Constraint Logic Programs - Hill (Correct)
0.1: A Correct, Precise and Efficient Integration of.. - Hill, Zaffanella.. (2001) (Correct)
0.1: Two Classes of Boolean Functions for Dependency Analysis - Armstrong, Marriott.. (1994) (Correct)
Related documents from co-citation: More All
10: Enhanced sharing analysis techniques: A comprehensive evaluation - Bagnara, Za et al. - 2000
8: freeness and linearity for the analysis of finite and rational tree languages (context) - Hill, Za et al. - 2004
8: Finite-tree analysis for constraint logic-based languages - Bagnara, Gori et al. - 2001
BibTeX entry: (Update)
R. Bagnara, E. Za#anella, R. Gori, and P. M. Hill. Boolean functions for finite-tree dependencies. Quaderno 252, Dipartimento di Matematica, Universita di Parma, 2001. Available at http://www.cs.unipr.it/~bagnara/. http://citeseer.ist.psu.edu/article/bagnara01boolean.html More
@article{ bagnara01boolean,
author = "Roberto Bagnara and Enea Zaffanella and Roberta Gori and Patricia M. Hill",
title = "{Boolean} Functions for Finite-Tree Dependencies",
journal = "Lecture Notes in Computer Science",
volume = "2250",
pages = "579+",
year = "2001",
url = "citeseer.ist.psu.edu/article/bagnara01boolean.html" }
Citations (may not include all citations):815 Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
218 Abstract interpretation and applications to logic programs (context) - Cousot, Cousot - 1992
142 Abstract interpretation frameworks (context) - Cousot, Cousot - 1992
94 Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984
77 Combinations of abstract domains for logic programming: Open.. - Cortesi, Le Charlier et al. - 2000
72 Prop revisited: Propositional formula as abstract domain for.. (context) - Cortesi, File et al. - 1991
72 Prolog and infinite trees (context) - Colmerauer - 1982
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
42 An application of abstract interpretation of logic programs:.. (context) - Sndergaard - 1986
37 On derived dependencies and connected databases (context) - Dart - 1991
33 Notes for a tutorial on abstract interpretation of logic pro.. (context) - Marriott, Sndergaard - 1989
25 Sharing and groundness dependencies in logic programs - Codish, Sndergaard et al. - 1999
24 Enhanced sharing analysis techniques: A comprehensive evalua.. - Bagnara, Za et al. - 2000
16 Finite-tree analysis for constraint logic-based languages - Bagnara, Gori et al. - 2001
16 Finite-tree analysis for constraint logic-based languages - Bagnara, Gori et al. - 2001
16 Pair-sharing over rational trees (context) - King - 2000
13 cient groundness analysis for logic programs (context) - Marriott, Sndergaard - 1993
10 Der Operationskreis des Logikkalkuls (context) - Schroder
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