Roberto Bagnara  Home/Search
Context Related
| strudel.di.unipi.it/pap...PLILP96.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: strudel.di.unipi.it/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitable domain for capturing the kind of dependencies arising in groundness analysis. Its (by now standard) implementation is based on reduced ordered binary-decision diagrams (ROBDDs), a well-known symbolic representation for Boolean functions. Even though several authors have reported positive experiences using ROBDDs for... (Update)
Context of citations to this paper: More
...for Pos. Unfortunately, the size of an ROBDDs is, in the worst case, exponential in the number of variables it depends upon. Earlier work [2] has shown that a hybrid representation that separates the definite information from the dependency information is considerably more...
...are used. For instance, all the abstract bindings arising from a bunch of uni cations are executed in one shot, instead of one at a time [3]. 2 Preliminaries Let S be a set. We will denote by S n the set of n tuples of elements drawn from S, whereas S denotes S n2N S n...
Cited by: More
Binary Decision Graphs - Mauborgne (1999) (Correct)
Semantics-Based Program Analysis for Logic-Based Languages .. - Codish, Demoen, Sagonas (1998) (Correct)
Structural Information Analysis for CLP Languages - Bagnara (1997) (Correct)
Similar documents (at the sentence level): More
77.4%: A Reactive Implementation of Pos Using ROBDDs - Bagnara (1996) (Correct)
14.4%: Straight ROBDDS are not the Best for Pos - Bagnara (Correct)
6.2%: Factorizing Equivalent Variable Pairs in ROBDD-Based.. - Bagnara, Schachte (1998) (Correct)
Active bibliography (related documents): More All
0.2: A Polymorphic Groundness Analysis of Logic Programs - Lu (Correct)
0.2: The AND-compositionality of CLP computed answer.. - Bagnara, Comini.. (1996) (Correct)
0.1: Compilation Techniques for Prolog - Lindgren (1996) (Correct)
Similar documents based on text: More All
0.6: Abstracting Numeric Constraints with Boolean Functions - Howe, King (Correct)
Related documents from co-citation: More All
9: Combinations of abstract domains for logic programming - Cortesi, Le Charlier et al. - 1994
8: Data-Flow Analysis for Constraint Logic-Based Languages (context) - Bagnara - 1997
7: Conceptual and software support for abstract domain design: Generic structural d.. (context) - Cortesi, Le Charlier et al. - 1993
BibTeX entry: (Update)
R. Bagnara. A Reactive Implementation of Pos using ROBDDs. In Programming Languages: Implementations, Logics and Programs, pages 107--121. SpringerVerlag, 1996. LNCS 1140. http://citeseer.ist.psu.edu/article/bagnara96reactive.html More
@inproceedings{ bagnara96reactive,
author = "Roberto Bagnara",
title = "A Reactive Implementation of Pos Using {ROBDDs}",
booktitle = "{PLILP}",
pages = "107-121",
year = "1996",
url = "citeseer.ist.psu.edu/article/bagnara96reactive.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986 ACM DBLP
510 Symbolic boolean manipulation with ordered binary-decision d.. - Bryant - 1992 ACM DBLP
344 Concurrent Constraint Programming (context) - Saraswat - 1993 ACM DBLP
312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979 ACM DBLP
218 Abstract interpretation and applications to logic programs (context) - Cousot, Cousot - 1992
134 ACM Transactions on Programming Languages and Systems (context) - Jaffar, Michaylov et al. - 1992
79 Static Inference of Modes and Data Dependencies in Logic Pro.. - Debray - 1989 ACM DBLP
77 Combinations of abstract domains for logic programming - Cortesi, Le Charlier et al. - 1994 ACM DBLP
72 Prop revisited: Propositional formula as abstract domain for.. (context) - Cortesi, File et al. - 1991 DBLP
70 A semantics-based framework for the abstract interpretation .. (context) - Jones, Sondergaard - 1987
62 Some global optimizations for a Prolog compiler (context) - Mellish - 1985 DBLP
58 Two classes of boolean functions for dependency analysis - Armstrong, Marriott et al. - 1994 ACM DBLP
49 Accurate and efficient approximation of variable aliasing in.. (context) - Jacobs, Langen - 1989
27 Conceptual and software support for abstract domain design: .. (context) - Cortesi, Le Charlier et al. - 1993 ACM
17 Groundness analysis for Prolog: Implementation and evaluatio.. - Le Charlier, Van Hentenryck - 1993 ACM
16 An application of constraint propagation to data-flow analys.. - Bagnara, Giacobazzi et al. - 1993
14 the detection of implicit and redundant numeric constraints .. - Bagnara - 1994
9 Evaluation of the domain PROP (context) - Van Hentenryck, Cortesi et al. - 1995
5 Science of Computer Programming (context) - Bagnara, of et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://strudel.di.unipi.it/papers/): More
Properties of the Lattice of Observables in Logic Programming - Amato, Levi (1997) (Correct)
An OR-Compositional Semantics for Logic Programs - Bossi, GABBRIELLI, LEVI, MEO (1993) (Correct)
Resultants Semantics for Prolog - Gabbrielli, Levi, Meo (1996) (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