by Roberto Giacobazzi, Isabella Mastroeni
http://profs.sci.univr.it/~mastroen/download/agp00.ps.gz
Add To MetaCart
Abstract:
We characterize the symmetric structure of Cousot's hierarchy of semantics in terms of a purely algebraic manipulation of abstract domains. We consider domain complementation in abstract interpretation as a formal method for systematically deriving complementary semantics of programming languages. We prove that under suitable hypothesis the semantics abstraction commutes with respect to domain complementation. This result allows us to prove that angelic and demonic/innite semantics are complementary and provide a minimal decomposition of all natural-style trace-based, relational, denotational, Dijkstra's predicate transformer and Hoare's axiomatic semantics. We apply this construction to the case of concurrent constraint programming, characterizing well known semantics as abstract interpretation of maximal traces of constraints. 1
Citations
|
1064
|
A Structural Approach to Operational Semantics
– Plotkin
- 1981
|
|
952
|
An Axiomatic Basis for Computer Programming
– Hoare
- 1969
|
|
437
|
Systematic Design of Program Analysis Frameworks
– Cousot, Cousot
- 1979
|
|
245
|
Semantics foundations of concurrent constraint programming
– Saraswat, Rinard, et al.
- 1991
|
|
194
|
Concurrent Constraint Programming Languages
– Saraswat
- 1989
|
|
154
|
Abstract interpretation: A uni lattice model for static analysis of programs by construction or approximation of
– Cousot, Cousot
- 1977
|
|
125
|
Recognizing safety and liveness
– Alpern, Schneider
- 1987
|
|
74
|
Constraint processing in cc(fd
– Hentenryck, Saraswat, et al.
- 1992
|
|
69
|
Cylindric Algebras (Part I
– Henkin, Monk, et al.
- 1971
|
|
64
|
Countable nondeterminism and random assignment
– Apt, Plotkin
- 1986
|
|
59
|
Proving concurrent constraint programs correct
– Boer, Gabbrielli, et al.
- 1997
|
|
52
|
Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation
– Cousot
- 1997
|
|
35
|
Complementation in abstract interpretation
– Cortesi, Fil'e, et al.
- 1997
|
|
30
|
Guarded commands, nondeterminancy and formal derivation of programs
– Dijkstra
- 1975
|
|
22
|
Complementation of abstract domains made easy
– Fil'e, Ranzato
- 1996
|
|
17
|
Refining and compressing abstract domains
– Giacobazzi, Ranzato
- 1997
|
|
14
|
Inductive De Semantics and Abstract Interpretation
– Cousot, Cousot
- 1992
|
|
12
|
Note on complemented closure operators of complete lattices
– Morgado
- 1962
|
|
11
|
Weak relative pseudo-complements of closure operators. Algebra Universalis
– Giacobazzi, Palamidessi, et al.
- 1996
|
|
11
|
The reduced relative power operation on abstract domains
– Giacobazzi, Ranzato
- 1999
|
|
10
|
Complementing logic program semantics
– Giacobazzi, Ranzato
- 1996
|
|
10
|
The structure of Galois connections
– Shmuely
- 1974
|
|
9
|
On the closure operators of a complete lattice
– Dwinger
- 1954
|
|
2
|
Lattice Theory. AMS Colloquium Publication, 3rd edition
– Birkho
- 1967
|
