We give a fully automated description of a small programming language PL in the theorem prover Isabelle98. The language syntax and semantics are encoded, and we formally verify a range of semantic properties. This is achieved via uniform (co)inductive methods. We encode notions of bisimulation and contextual equivalence. The main original contribution of this paper is a fully automated proof that PL bisimulation coincides with PL contextual equivalence.
CITATION STYLE
Ambler, S. J., & Crole, R. L. (1999). Mechanized operational semantics via (Co)induction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1690, pp. 221–238). Springer Verlag. https://doi.org/10.1007/3-540-48256-3_15
Mendeley helps you to discover research relevant for your work.