Baudouin Le Charlier, Pascal Van Hentenryck  Home/Search
Context Related
| brown.edu/pub/techreport...cs9249.ps.Z 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: brown.edu/publications...CS9249 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The domain Prop [22, 8] is a conceptually simple and elegant abstract domain to compute groundness information for Prolog programs. In particular, abstract substitutions are represented by Boolean functions built using the logical connectives ,;;. Prop has raised much theoretical interest recently but little is known about the practical accuracy and efficiency of this domain. Experimental evaluation of Prop is particularly important since Prop theoretically needs to solve a co-NP-Complete... (Update)
Context of citations to this paper: More
...practical for real world programs. A natural representation for Boolean functions, used for example by Le Charlier and Van Hentenryck [13], is by means of ordered binary decision graphs [1] Le Charlier and Van Hentenryck report good results from instantiating a generic...
.... early attempts, some classes of Boolean functions have been recognized as constituting good abstract domains for groundness analysis [7, 16, 1, 19]. In particular, the set of positive Boolean functions, namely, those functions which assume the true value under the valuation...
Cited by: More
A Reactive Implementation of Pos Using ROBDDs - Bagnara (1996) (Correct)
Analyzing Logic Programs Using "Prop"-Ositional Logic.. - Codish, Demoen (1997) (Correct)
Precise and Efficient Groundness Analysis for Logic Programs - Marriott, Søndergaard (1993) (Correct)
Similar documents (at the sentence level):
5.0%: Combinations of Abstract Domains for Logic.. - Cortesi, Le.. (2000) (Correct)
Active bibliography (related documents): More All
1.3: A Universal Top-Down Fixpoint Algorithm - Le Charlier, Van Hentenryck (1992) (Correct)
0.7: Generic Abstract Interpretation Algorithms for.. - Englebert, Le.. (1993) (Correct)
0.4: Type Analysis of Prolog Using Type Graphs - Van Hentenryck, Cortesi, Le.. (1993) (Correct)
Similar documents based on text: More All
0.5: Automated Verification Of Prolog Programs - Le Charlier, Leclere, Rossi.. (1994) (Correct)
0.5: Cardinality Analysis of Prolog - Braem, Le Charlier, Modart, Van.. (1994) (Correct)
0.5: Distributed Audit Trail Analysis - Mounji, Le Charlier, Zampunieris.. (1994) (Correct)
Related documents from co-citation: More All
13: Prop revisited: Propositional formula as abstract domain for groundness analysis (context) - Cortesi, File et al. - 1991
12: ositional Logic Programs and a Magic Wand (context) - Codish, Demoen et al. - 1993
8: Abstract interpretation: a unified lattice model for static analysis of programs.. (context) - Cousot, Cousot - 1977
BibTeX entry: (Update)
B. Le Charlier and P. Van Hentenryck. Groundness analysis for Prolog: Implementation and evaluation of the domain Prop. In Proceedings of PEPM'93, the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 99--110, Copenhagen, June 1993. http://citeseer.ist.psu.edu/lecharlier92groundness.html More
@inproceedings{ lecharlier93groundness,
author = "Baudouin Le Charlier and Pascal Van Hentenryck",
title = "Groundness Analysis for {PROLOG}: Implementation and Evaluation of the Domain Prop ",
booktitle = "Partial Evaluation and Semantic-Based Program Manipulation",
pages = "99-110",
year = "1993",
url = "citeseer.ist.psu.edu/lecharlier92groundness.html" }
Citations (may not include all citations):1726 Graph Based Algorithms for Boolean Function Manipulation - Bryant - 1986
380 Constraint Satisfaction in Logic Programming (context) - Van Hentenryck - 1989
112 The Art of Prolog: Advanced Programming Techniques (context) - Sterling, Shapiro - 1986
108 A Practical Framework for the Abstract Interpretation of Log.. (context) - Bruynooghe - 1991
81 Solving Large Combinatorial Problems in Logic Programming (context) - Dincbas, Simonis et al. - 1990
72 Prop revisited: Propositional formulas as abstract domain fo.. (context) - Cortesi, File et al. - 1991
63 A Storeless Model of Aliasing and its Abstraction using Fini.. (context) - Deutsch - 1992
54 Experimental Evaluation of a Generic Abstract Interpretation.. (context) - Le Charlier, Van Hentenryck - 1992
52 Global Flow Analysis as a Practical Compilation Tool - Hermenegildo, Warren et al. - 1992
49 Accurate and Efficient Approximation of Variable Aliasing in.. (context) - Jacobs, Langen - 1989
48 A General Framework for Semantics-based Bottom-up Abstract I.. - Barbuti, Giacobazzi et al.
41 Analysis of Constraint Logic Programs (context) - Marriott, Sondergaard - 1990
37 Abstract Interpretation: Towards the Global Optimization of .. (context) - Bruynooghe - 1987
36 An Instance of Abstract Interpretation: Integrating Type and.. (context) - Bruynooghe, Janssens - 1988
34 the Practicality of Global Flow Analysis of Logic Programs (context) - Warren, Hermedegildo et al. - 1988
34 Determination of Variable Dependence Information Through Abs.. (context) - Muthukumar, Hermenegildo - 1989
33 Notes for a Tutorial on Abstract Interpretation of Logic Pro.. (context) - Marriott, Sondergaard - 1989
26 Abstract Interpretation of Concurrent Logic Languages (context) - Codognet, Codognet et al. - 1990
22 A Generic Abstract Interpretation Algorithm and its Complexi.. (context) - Le Charlier, Musumbu et al. - 1991
20 Semantics-based Dataflow Analysis of Logic Programs (context) - Marriott, Sondergaard - 1989
18 Comparison of abstract interpretations (context) - Cortesi, File et al. - 1992
14 Generic Abstract Interpretation Algorithms for Prolog: Two O.. - Englebert, Le Charlier et al. - 1992
14 Reexecution in Abstract Interpretation of Prolog (context) - Le Charlier, Van Hentenryck - 1992
14 A Universal Top-Down Fixpoint Algorithm - Le Charlier, Van Hentenryck - 1992
13 Finite Fixed-Point Problems (context) - O'Keefe - 1987
7 Interpretation Abstraite de Programmes Prolog (context) - Musumbu - 1990
6 A Complete Framework for the Abstract Interpretation of Logi.. (context) - Corsini, File - 1989
5 Analysing Success Patterns of Logic Programs by Abstract Hyb.. (context) - Kanamori, Kawamura - 1987
3 A minimal function graph semantics for logic programs (context) - Winsborough - 1987
2 volume Abstract Interpretation of Declarative Languages (context) - Mellish, of - 1987
The graph only includes citing articles where the year of publication is known.
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