Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella  Home/Search
Context Related
| cs.unipr.it/~bagnar...Q363600DPI.ps.gz 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: Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can provide very e#cient representations of grammars and other useful objects). 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... (Update)
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):
66.6%: An Efficient and Precise Finite-Tree Analysis for.. - Bagnara, Zaffanella, .. (Correct)
20.6%: Boolean Functions for Finite-Tree Dependencies - Bagnara, Zaffanella, Gori, Hill (2001) (Correct)
Active bibliography (related documents): More All
1.0: A Correct, Precise and Efficient Integration of.. - Hill, Zaffanella.. (2001) (Correct)
0.5: Semantic-Based Software Support for Constraint Logic Programs - Hill (Correct)
0.3: Soundness, Idempotence and Commutativity of Set-Sharing - Hill, Bagnara, Zaffanella (Correct)
Similar documents based on text: More All
0.5: Widening Sharing - Zaffanella, Bagnara, Hill (Correct)
Related documents from co-citation: More All
23: Enhanced sharing analysis techniques: A comprehensive evaluation - Bagnara, Za et al. - 2000
15: Abstract interpretation frameworks (context) - Cousot, Cousot - 1992
15: Pair-sharing over rational trees (context) - King - 2000
BibTeX entry: (Update)
R. Bagnara, R. Gori, P. M. Hill, and E. Za anella. Finite-tree analysis for constraint logic-based languages. Quaderno 251, Dipartimento di Matematica, Universita di Parma, 2001. Available at http://www.cs.unipr.it/~bagnara/. http://citeseer.ist.psu.edu/bagnara01finitetree.html More
@article{ bagnara01finitetree,
author = "Roberto Bagnara and Roberta Gori and Patricia M. Hill and Enea Zaffanella",
title = "Finite-Tree Analysis for Constraint Logic-Based Languages",
journal = "Lecture Notes in Computer Science",
volume = "2126",
pages = "165--??",
year = "2001",
url = "citeseer.ist.psu.edu/bagnara01finitetree.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
620 Head-Driven Phrase Structure Grammar - Pollard, Sag - 1994
510 Symbolic boolean manipulation with ordered binary-decision d.. - Bryant - 1992 ACM DBLP
261 An introduction to Prolog-III (context) - Colmerauer - 1990
218 Abstract interpretation and applications to logic programs (context) - Cousot, Cousot - 1992
142 Abstract interpretation frameworks (context) - Cousot, Cousot - 1992 DBLP
118 Complete axiomatizations of the algebras of finite (context) - Maher - 1988
115 Magic Templates: A spellbinding approach to logic programs - Ramakrishnan - 1988 DBLP
105 Records for logic programming - Smolka, Treinen - 1994 DBLP
94 Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984 DBLP
89 Deriving descriptions of possible values of program variable.. (context) - Janssens, Bruynooghe - 1992 ACM DBLP
88 Static analysis of logic programs for independent AND parall.. (context) - Jacobs, Langen - 1992 ACM
82 ACM Transactions on Programming Languages and Systems (context) - Debray, Lin et al. - 1993
77 Combinations of abstract domains for logic programming: Open.. - Cortesi, Le Charlier et al. - 2000 DBLP
72 Prop revisited: Propositional formula as abstract domain for.. (context) - Cortesi, File et al. - 1991 DBLP
72 Prolog and infinite trees (context) - Colmerauer - 1982
59 Set-sharing is redundant for pair-sharing - Bagnara, Hill et al. - 2002
58 Two classes of Boolean functions for dependency analysis - Armstrong, Marriott et al. - 1998 ACM DBLP
57 The Logic of Typed Feature Structures with Applications to U.. (context) - Carpenter - 1992
55 Data-flow analysis for constraint logic-based languages (context) - Bagnara - 1997
53 A semantic basis for the termination analysis of logic progr.. - Codish, Taboch - 1999 DBLP
53 A semantic basis for termination analysis of logic programs .. - Codish, Taboch - 1997 ACM DBLP
51 grammar and set-constraint-based program analysis by abstrac.. (context) - Cousot, Cousot et al. - 1995
42 An application of abstract interpretation of logic programs:.. (context) - Sndergaard - 1986 ACM DBLP
37 On derived dependencies and connected databases (context) - Dart - 1991 ACM DBLP
35 ProFIT: Prolog with Features (context) - Erbach - 1995
33 Notes for a tutorial on abstract interpretation of logic pro.. (context) - Marriott, Sndergaard - 1989
28 Department of Computer Science (context) - Eggert, Chow et al. - 1983
27 Sharing is optimal (context) - Cortesi, File - 1999 DBLP
26 Derivation and safety of an abstract unification algorithm f.. (context) - Codish, Dams et al. - 1991 DBLP
25 Sharing and groundness dependencies in logic programs - Codish, Sndergaard et al. - 1999 ACM DBLP
24 Enhanced sharing analysis techniques: A comprehensive evalua.. - Bagnara, Za et al. DBLP
24 Enhanced sharing analysis techniques: A comprehensive evalua.. - Bagnara, Za et al. - 2000 DBLP
21 Type analysis of Prolog using type graphs - Van Hentenryck, Cortesi et al. - 1995 ACM DBLP
20 cient approximation of variable aliasing in logic programs (context) - Jacobs, Langen - 1989
19 The quotient of an abstract interpretation for comparing sta.. (context) - Cortesi, File et al. - 1998
17 A comparison of three occur-check analysers - Crnogorac, Kelly et al. - 1996 ACM DBLP
17 Constraint logic programming and the unification of informat.. (context) - Mukai - 1991
17 Factorizing equivalent variable pairs in ROBDD-based impleme.. - Bagnara, Schachte - 1999 ACM DBLP
17 cient chaotic iteration strategies with widenings (context) - Bourdoncle - 1993
17 Semantiques des langages imperatifs d'ordre superieur et int.. (context) - Bourdoncle - 1993
17 Decomposing non-redundant sharing by complementation - Za, Hill et al. - 2002 ACM DBLP
16 Finite-tree analysis for constraint logic-based languages - Bagnara, Gori et al. - 2001 ACM DBLP
16 Pair-sharing over rational trees (context) - King - 2000 DBLP
15 TermiLog: A system for checking termination of queries to lo.. - Lindenstrauss, Sagiv et al. - 1997 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
13 A Prolog interpreter working with infinite terms (context) - Filgueiras DBLP
13 and optimization using the ciao system preprocessor (context) - Hermenegildo, Bueno et al. - 1999
13 cient groundness analysis for logic programs (context) - Marriott, Sndergaard - 1993
11 Specification-based automatic verification of Prolog program.. - Cortesi, Le Charlier et al. - 1997 ACM DBLP
10 a Logic Program Theorem Prover (context) - Stark, foundations et al. - 1998
10 Elli HorwoodHalsted PresWiley (context) - Implementations, Ellis et al. - 1984
10 Parser generation and grammar manipulation using Prolog's in.. (context) - Giannesini, Cohen - 1984 DBLP
10 also available SIC Dissertation Serie SICD SE (context) - constraints, The et al. - 1994
10 Der Operationskreis des Logikkalkuls (context) - Schroder
9 cient implementation of unification of cyclic structures (context) - Haridi, Sahlin
9 Abstract domains for sharing analysis by optimal semantics (context) - Scozzari - 2000 ACM DBLP
8 freeness and linearity for the analysis of finite and ration.. (context) - Hill, Za et al. - 2004
8 freeness and linearity for the analysis of finite and ration.. (context) - Hill, Za et al. - 2001
8 Theory and Practice of Logic Programming (context) - Hill, Bagnara et al. - 2002
7 cient structural information analysis for real CLP languages (context) - Bagnara, Hill et al. - 2000
7 Total correctness of pure Prolog programs: A formal approach (context) - Stark - 1996
6 Boolean functions for finite-tree dependencies - Bagnara, Za et al. - 2001 ACM DBLP
6 Journal of Symbolic Computation (context) - Berarducci, Zilli et al. - 1993
6 Universidade do Porto (context) - Costa, Damas et al. - 2001
6 ciency in the sharing analysis of real logic languages (context) - Za, Correctness - 2001
5 Prolog-II as an instance of the logic programming scheme (context) - Ja, Lassez et al. - 1987
5 Intelligent Systems Laboratory (context) - of, Science - 2002
4 An application of rational trees in a logic programming inte.. (context) - Carro - 2004
4 cTI: A constraint-based termination inference tool for ISO-P.. (context) - Mesnard, Bagnara
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