Formal verification of compilers and static analyzers. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Formal verification of compilers and static analyzers.

Abstract

Static analysis – the automatic determination of simple properties of a program – is the basis both for optimizing compilation and for verification of safety properties such as absence of run-time errors. To support the use of static analyses in verified compilers and in high-confidence verification environments, the analyses must be proved to be sound. In this invited talk, I will review some ongoing work in this direction in the CompCert and Verasco projects, in particular the construction and formal verification of a modular static analyzer based on abstract interpretation.
No file

Dates and versions

hal-01242094 , version 1 (11-12-2015)

Identifiers

  • HAL Id : hal-01242094 , version 1

Cite

Sandrine Blazy. Formal verification of compilers and static analyzers. . PLMW@POPL 2015 - Programming Languages Mentoring Workshop, Jan 2015, Mumbai, India. ⟨hal-01242094⟩
169 View
0 Download

Share

Gmail Facebook X LinkedIn More