TY - JOUR
T1 - Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
AU - Cousot, Patrick
PY - 2002/4/28
Y1 - 2002/4/28
N2 - We construct a hierarchy of semantics by successive abstract interpretations. Starting from the maximal trace semantics of a transition system, we derive the big-step semantics, termination and nontermination semantics, Plotkin's natural, Smyth's demoniac and Hoare's angelic relational semantics and equivalent nondeterministic denotational semantics (with alternative powerdomains to the Egli-Milner and Smyth constructions), D. Scott's deterministic denotational semantics, the generalized and Dijkstra's conservative/liberal predicate transformer semantics, the generalized/total and Hoare's partial correctness axiomatic semantics and the corresponding proof methods. All the semantics are presented in a uniform fixpoint form and the correspondences between these semantics are established through composable Galois connections, each semantics being formally calculated by abstract interpretation of a more concrete one using Kleene and/or Tarski fixpoint approximation transfer theorems.
AB - We construct a hierarchy of semantics by successive abstract interpretations. Starting from the maximal trace semantics of a transition system, we derive the big-step semantics, termination and nontermination semantics, Plotkin's natural, Smyth's demoniac and Hoare's angelic relational semantics and equivalent nondeterministic denotational semantics (with alternative powerdomains to the Egli-Milner and Smyth constructions), D. Scott's deterministic denotational semantics, the generalized and Dijkstra's conservative/liberal predicate transformer semantics, the generalized/total and Hoare's partial correctness axiomatic semantics and the corresponding proof methods. All the semantics are presented in a uniform fixpoint form and the correspondences between these semantics are established through composable Galois connections, each semantics being formally calculated by abstract interpretation of a more concrete one using Kleene and/or Tarski fixpoint approximation transfer theorems.
UR - http://www.scopus.com/inward/record.url?scp=0037188218&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037188218&partnerID=8YFLogxK
U2 - 10.1016/S0304-3975(00)00313-3
DO - 10.1016/S0304-3975(00)00313-3
M3 - Article
AN - SCOPUS:0037188218
SN - 0304-3975
VL - 277
SP - 47
EP - 103
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-2
ER -