(Enter summary)
Abstract: The use of infinite abstract domains with widening and narrowing for accelerating the convergence of abstract interpretations is shown to be more powerful than the Galois connection approach restricted to finite lattices (or lattices satisfying the chain condition). (Update)
Cited by: More
Semantics-based Program Analysis via - Symbolic Composition Of
(Correct)
Regular Trees as an Abstract Domain for Program Specialisation - Gallagher, Peralta (2000)
(Correct)
A Generic Object-Oriented Incremental Analyser - For Constraint Logic (1996)
(Correct)
Similar documents (at the sentence level):
8.8%: he Galois Connect93 and Widening/Narrowing Approaches t.. - Patrick Cou And
(Correct)
Active bibliography (related documents): More All
0.2: Comparison of the Galois Connexion and Widening/Narrowing.. - Cousot, Cousot (1991)
(Correct)
0.2: On the Desirable Link Between Theory and Practice in.. - Le Charlier, Flener (1997)
(Correct)
0.2: Comparison of the Galois connection and widening/narrowing.. - Cousot, Cousot (1991)
(Correct)
Similar documents based on text: More All
0.7: Modular Static Program Analysis - Cousot, Cousot (2002)
(Correct)
0.6: On Abstraction in Software Verification - Cousot, Cousot (2002)
(Correct)
0.5: Refining Model Checking by Abstract Interpretation - Cousot, Cousot (1999)
(Correct)
Related documents from co-citation: More All
26: Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
26: Automatic Discovery of Linear Restraints among Variables of a Program
- Cousot, Halbwachs - 1978
23: Abstract interpretation: a unified lattice model for static analysis of programs.. (context) - Cousot, Cousot - 1977
BibTeX entry: (Update)
P. Cousot and R. Cousot. Comparing the Galois connection and widening-narrowing approaches to abstract interpretation. In Programming Language Implementation and Logic Programming, 4th Intl. Symp, PLILP'92, volume 631 of Lecture Notes on Computer Science, pp. 269-- 295. Springer Verlag, Aug. 1992. http://citeseer.ist.psu.edu/cousot92comparing.html More
@inproceedings{ cousot92comparing,
author = "P. Cousot and R. Cousot",
title = "Comparing the {Galois} Connection and Widening/Narrowing Approaches to Abstract Interpretation",
booktitle = "Proceedings of the Fourth International Symposium on Programming Language Implementation and Logic Programming",
publisher = "LNCS 631, Springer-Verlag",
address = "Leuven, Belgium",
editor = "M. Bruynooghe and M. Wirsing",
pages = "269 --295",
year = "1992",
url = "citeseer.ist.psu.edu/cousot92comparing.html" }
Citations (may not include all citations):
815
Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
312
Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
250
Automatic discovery of linear restraints among variables of ..
- Cousot, Halbwachs - 1978
248
The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
218
Abstract interpretation and application to logic programs (context) - Cousot, Cousot - 1992
142
Abstract interpretation frameworks (context) - Cousot, Cousot - 1992
138
Abstract Interpretation of Declarative Languages (context) - Abramsky, Hankin - 1987
75
semantics and abstract interpretation (context) - Cousot, Cousot - 1992
66
A technique for summarizing data access and its use in paral.. (context) - Balasundaram, Kennedy - 1989
65
Semantic foundations of program analysis (context) - Cousot - 1981
63
A storeless model of aliasing and its abstraction using fini.. (context) - Deutsch - 1992
61
The theory and practice of transforming call-by-need into ca.. (context) - Mycroft - 1980
54
Static determination of dynamic properties of programs (context) - Cousot, Cousot - 1976
44
Static determination of dynamic properties of recursive proc.. (context) - Cousot, Cousot - 1977
37
Abstract interpretation: towards the global optimization of .. (context) - Bruynooghe, Janssens et al. - 1987
23
Abstract interpretation by dynamic partitioning (context) - Bourdoncle - 1992
23
Constructive versions of Tarski's fixed point theorems
- Cousot, Cousot - 1979
22
Deriving constraints among argument sizes in logic programs (context) - van Gelder - 1990
16
Static analysis of arithmetical congruences (context) - Granger - 1989
10
On describing success patterns of logic programs (context) - Marriott, Sondergaard - 1988
10
Approximate fixed points in abstract interpretation (context) - Hankin, Hunt - 1990
5
Abstract semantics (context) - Kieburtz, Napierala - 1987
1
ese d"etat `es sciences math (context) - Cousot, de construction et al. - 1978
1
ese de l"ecole Polytechnique en informatique, LIX (context) - Granger, de congruence - 1991
1
ese de 3 `eme cycle d (context) - Halbwachs, de relations et al. - 1979
1
ese de doctorat en science, Universit (context) - Stransky, de structures et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pllab.kaist.ac.kr/seminar/ppg/cousot/): More
Compositional and Inductive Semantic Definitions in Fixpoint, .. - Cousot, Cousot (1995)
(Correct)
Formal Language, Grammar and Set-Constraint-Based Program.. - Cousot, Cousot (1995)
(Correct)
Constructive Design of a Hierarchy of Semantics of a Transition.. - Cousot (1997)
(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