(Enter summary)
Abstract: Completeness in abstract interpretation is an ideal situation where the abstract semantics is able to take full advantage of the power of representation of the underlying abstract domain. Thus, complete abstract interpretations can be rightfully considered as optimal. In this article, we develop a general theory of completeness in abstract interpretation, also dealing with the most frequent case of least fixpoint semantics. We show that both completeness and least fixpoint completeness are... (Update)
Cited by: More
Abstraction Refinement via Inductive Learning - Alexey Loginov Thomas
(Correct)
Typestate Verification: Abstraction Techniques and.. - Field Goyal Ramalingam (2003)
(Correct)
Temporal Property-driven Verification by Abstract Interpretation - Massé (2002)
(Correct)
Active bibliography (related documents): More All
0.9: Uniform Closures: Order-Theoretically Reconstructing Logic.. - Giacobazzi, al. (1998)
(Correct)
0.9: Functional Compositions of Abstract Interpretations - Giacobazzi, al.
(Correct)
0.7: "Optimal" Collecting Semantics for Analysis in a Hierarchy of.. - Giacobazzi
(Correct)
Similar documents based on text: More All
0.9: Weak Relative Pseudo-Complements of Closure Operators - Giacobazzi, Palamidessi.. (1996)
(Correct)
0.6: Complementing Logic Program Semantics - Roberto Giacobazzi Francesco (1996)
(Correct)
0.5: Pseudocomplements of Closure Operators on Posets - Ranzato
(Correct)
Related documents from co-citation: More All
13: Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
7: Construction of abstract state graphs with pvs
- Graf, Saidi - 1997
6: Counterexample-guided abstraction refinement
- Clarke, Grumberg et al. - 2000
BibTeX entry: (Update)
R. Giacobazzi, F. Ranzato, and F. Scozzari. Making Abstract Interpretations Complete. Journal of the ACM, 47(2):361-416, 2000. http://citeseer.ist.psu.edu/giacobazzi97making.html More
@article{ giacobazzi00making,
author = "Roberto Giacobazzi and Francesco Ranzato and Francesca Scozzari",
title = "Making abstract interpretations complete",
journal = "Journal of the ACM",
volume = "47",
number = "2",
pages = "361--416",
year = "2000",
url = "citeseer.ist.psu.edu/giacobazzi97making.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
245
A Compendium of Continuous Lattices (context) - Gierz, Hofmann et al. - 1980
231
Model checking and abstraction
- Clarke, Grumberg et al. - 1994
218
Abstract interpretation and application to logic programs (context) - Cousot, Cousot
211
Domain theory
- Abramsky, Jung - 1994
166
Unification revisited (context) - Lassez, Maher et al. - 1988
128
Declarative modeling of the operational behavior of logic la.. (context) - Falaschi, Levi et al. - 1989
96
Property preserving abstractions for the verification of con..
- Loiseaux, Graf et al. - 1995
75
semantics and abstract interpretation (context) - Cousot, Cousot
71
Abstract interpretation and optimising transformations for a.. (context) - Mycroft - 1981
63
Theorem proving with abstraction (context) - Plaisted - 1981
61
The theory and practice of transforming call-by-need into ca.. (context) - Mycroft - 1980
59
Set-sharing is redundant for pair sharing
- Bagnara, Hill et al. - 1997
58
Two classes of Boolean functions for dependency analysis
- Armstrong, Marriott et al. - 1997
48
Backwards analysis of functional programs (context) - Hughes - 1988
39
Abstract interpretation of reactive systems (context) - Dams, Gerth et al. - 1997
38
Escape analysis on lists
- Park, Goldberg - 1992
37
Types as abstract interpretations (context) - Cousot
36
Precise and efficient groundness analysis for logic programs
- Marriott, Sndergaard - 1993
30
Optimal groundness analysis using propositional logic (context) - Cortesi, Fil'e et al. - 1996
29
Complementation in abstract interpretation (context) - Cortesi, Fil'e et al. - 1997
26
the complexity of escape analysis (context) - Syst, Deutsch et al. - 1997
22
The closure operators of a lattice (context) - Ward - 1942
20
Abstract interpretation (context) - Cousot
19
A unifying view of abstract domain design (context) - Fil'e, Giacobazzi et al. - 1996
18
An algebraic theory of observables
- Comini, Levi - 1994
17
Disjunctive strictness analysis (context) - Jensen - 1992
17
Constructive design of a hierarchy of semantics of a transit..
- Cousot
15
Functional dependencies and Moore-set completions of abstrac..
- Giacobazzi, Ranzato - 1995
14
Some results on the closure operators of partially ordered s.. (context) - Morgado - 1960
13
Characterization of a sequentially consistent memory and ver..
- Graf - 1997
11
The powerset operator on abstract interpretations (context) - Fil'e, Ranzato - 1998
10
Abstract interpretation of constraints on order-sorted domai.. (context) - Caseau - 1991
9
Intuitionistic implication in abstract interpretation (context) - Giacobazzi, Scozzari - 1997
8
A constructive characterization of the lattices of all retra.. (context) - Cousot, Cousot
8
Galois connection based abstract interpretation for strictne.. (context) - Cousot, Cousot - 1993
8
Strong abstract interpretation using power domains (context) - Mycroft, Nielson - 1983
7
Higher-order abstract interpretation (context) - Cousot, Cousot - 1994
7
Optimal domains for disjunctive abstract interpretation (context) - Giacobazzi, Ranzato - 1998
6
the complexity of dataflow analysis of logic programs
- Debray - 1995
5
Refining and compressing abstract domains (context) - Giacobazzi, Ranzato - 1997
5
Formal bases for dataflow analysis of logic programs (context) - Debray - 1994
4
Spatial query optimization: From boolean constraints to rang.. (context) - Helm, Marriott et al. - 1995
3
Properties of the lattice of observables in logic programmin..
- Amato, Levi - 1997
2
Optimal data flow analysis via observational equivalence (context) - Steffen - 1989
2
the power and limitation of strictness analysis
- Sekar, Mishra et al. - 1997
2
the power of abstract interpretation (context) - Reddy, Kamin - 1992
1
Compositional characterization of observable program propert.. (context) - Mathematical, Computer et al. - 1992
1
A general framework for semantics-based bottom-up abstract i.. (context) - Science, Springer-Verlag et al. - 1993
1
Introduction to Lattices and Order (context) - Lang, -- et al. - 1990
1
Denotational abstract interpretation of logic programs (context) - Lett, Lang et al. - 1994
1
am. 27, 2, 137--167. Cousot, P. 1978. M'ethodes It'eratives .. (context) - Progr - 1978
1
Bottom-up abstract interpretation of logic programs (context) - Lang, -- et al. - 1994
1
Compositional and inductive semantic definitions in fixpoint (context) - Society, Los et al. - 1995
1
Preliminary version (context) - Sci - 1996
1
Completeness and predicate-based abstract interpretation (context) - thesis, Univ et al. - 1993
1
Suspension analyses for concurrent logic programs (context) - Comput, -- et al. - 1994
1
Transformations on higher-order functions (context) - in, Science et al. - 1989
1
Program analysis position statement: The abstract interpreta..
- Cousot - 1996
1
Accumulated imprecision in abstract interpretation (context) - Trans, Lang et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.di.unipi.it/ricerca/tr.html): More
Verification of Logic Programs - Pedreschi, Ruggieri (1997)
(Correct)
Chemical Tree Enumeration Algorithms. - Aringhieri, Hansen, Malucelli (1999)
(Correct)
Confluence in Concurrent Constraint Programming - Falaschi, Gabbrielli.. (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