DeepSpec Summer School 2017

The formal verification of compilers

Xavier Leroy


Formal semantics of programming languages supports not only reasoning over individual programs (program correctness), but also reasoning over program transformations and static analyses, as typically found in compilers (tool correctness). With the help of a proof assistant, we can prove semantic preservation properties of program transformations and semantic soundness properties of static analyses that greatly increase the confidence we can have in compilers and program verification tools.

The topics covered in this course include:

We use the Coq proof assistant and build on the formalization of the IMP language from Logical Foundations by Pierce et al.

Course material

Introductory reading