Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form

Patrick Cousot, Radhia Cousot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a language and semantics-independent, compositional and inductive method for specifying formal semantics or semantic properties of programs in equivalent fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form. The definitional method is obtained by extending set-theoretic definitions in the context of partial orders. It is parameterized by the language syntax, by the semantic domains and by the semantic transformers corresponding to atomic and compound program components. The definitional method is shown to be preserved by abstract interpretation in either fixpoint, equational, constraint, closure-condition, rule-based or game-theoretic form. The features common to all possible instantiations are factored out thus allowing for results of general scope such as well-definedness, semantic equivalence, soundness and relative completeness of abstract interpretations, etc. to be proved compositionally in a general language and semantics-independent framework.

Original languageEnglish (US)
Title of host publicationComputer Aided Verification - 7th International Conference, CAV 1995, Proceedings
EditorsPierre Wolper
PublisherSpringer Verlag
Pages293-308
Number of pages16
ISBN (Print)9783540600459
StatePublished - 1995
Event7th International Conference on Computer Aided Verification, CAV 1995 - Liege, Belgium
Duration: Jul 3 1995Jul 5 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume939
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Conference on Computer Aided Verification, CAV 1995
CountryBelgium
CityLiege
Period7/3/957/5/95

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form'. Together they form a unique fingerprint.

  • Cite this

    Cousot, P., & Cousot, R. (1995). Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form. In P. Wolper (Ed.), Computer Aided Verification - 7th International Conference, CAV 1995, Proceedings (pp. 293-308). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 939). Springer Verlag.