Bi-inductive structural semantics

Authors:
Patrick Cousot;Radhia Cousot
Affiliations:
École normale supérieure, 45 rue d'Ulm, 75230 Paris cedex 05, France and Courant Institute of Math. Sciences, New York University, New York, NY 10012;CNRS & ÉÉcole normal supérieure, 45 rue d'Ulm, 75230 Paris cedex 05, France
Venue:
Information and Computation
Year:
2009

Citing 16
Cited 6

Natural Semantics

Proceedings of the first Franco-Japanese Symposium on Programming of future generation computers
Denotational semantics

Handbook of theoretical computer science (vol. B)
Operational and algebraic semantics of concurrent processes

Handbook of theoretical computer science (vol. B)
Inductive definitions, semantics and abstract interpretations

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types as abstract interpretations

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
An axiomatic basis for computer programming

Communications of the ACM
An introduction to metric semantics: operational and denotational models for programming and specification languages

Theoretical Computer Science
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

Theoretical Computer Science
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Incremental Evaluation of Natural Semantics Specification

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
The Theory and Practice of Transforming Call-by-need into Call-by-value

Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-Theoretic Form

Proceedings of the 7th International Conference on Computer Aided Verification
Towards a Mathematical Operational Semantics

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Bialgebraic Methods in Structural Operational Semantics

Electronic Notes in Theoretical Computer Science (ENTCS)
Coinductive big-step operational semantics

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Trace-Based Coinductive Operational Semantics for While

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Metric spaces and termination analyses

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
A hoare logic for the coinductive trace-based big-step semantics of while

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Formal verification by abstract interpretation

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Operational semantics using the partiality monad

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Pretty-Big-Step semantics

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a simple order-theoretic generalization, possibly non-monotone, of set-theoretic inductive definitions. This generalization covers inductive, co-inductive and bi-inductive definitions and is preserved by abstraction. This allows structural operational semantics to describe simultaneously the finite terminating and infinite diverging behaviors of programs. This is illustrated on grammars and the structural bifinitary small big-step trace relational operational semantics of the call-by-value @l-calculus (for which co-induction is shown to be inadequate).