Inductive definitions, semantics and abstract interpretation

Patrick Cousot, Radhia Cousot

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

Abstract

We introduce and illustrate a specification method combining rule-based inductive definitions, well-founded induction principles, fixed-point theory and abstract interpretation for general use in computer science. Finite as well as infinite objects can be specified, at various levels of details related by abstraction. General proof principles are applicable to prove properties of the specified objects. The specification method is illustrated by introducing GSOS, a structured operational semantics generalizing Plotkin's structured operational semantics (SOS) so as to describe the finite, as well as the infinite behaviors of programs in a uniform way and by constructively deriving inductive presentations of the other (relational, denotational, predicate transformers, ...) semantics from GSOS by abstract interpretation.

Original languageEnglish (US)
Title of host publicationConference Record of the Annual ACM Symposium on Principles of Programming Languages
Editors Anon
PublisherPubl by ACM
Pages83-94
Number of pages12
ISBN (Print)0897914538
StatePublished - 1992
Event19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - Albuquerque, NM, USA
Duration: Jan 19 1992Jan 22 1992

Publication series

NameConference Record of the Annual ACM Symposium on Principles of Programming Languages
ISSN (Print)0730-8566

Other

Other19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
CityAlbuquerque, NM, USA
Period1/19/921/22/92

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Inductive definitions, semantics and abstract interpretation'. Together they form a unique fingerprint.

Cite this