Mechanized semantics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2010

Mechanized semantics


The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and over generic program transformations, as typically found in compilers. The topics covered include: operational semantics (small-step, big-step, definitional interpreters); a simple form of denotational semantics; axiomatic semantics and Hoare logic; generation of verification conditions, with application to program proof; compilation to virtual machine code and its proof of correctness; an example of an optimizing program transformation (dead code elimination) and its proof of correctness.
Fichier principal
Vignette du fichier
notes.pdf (257.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00529848 , version 1 (26-10-2010)



Xavier Leroy. Mechanized semantics. J. Esparza and B. Spanfelner and O. Grumberg. Logics and languages for reliability and security, 25, IOS Press, pp.195-224, 2010, NATO Science for Peace and Security Series D: Information and Communication Security, ⟨10.3233/978-1-60750-100-8-195⟩. ⟨inria-00529848⟩


124 View
204 Download



Gmail Facebook X LinkedIn More