A formally verified compiler back-end - Archive ouverte HAL Access content directly
Journal Articles Journal of Automated Reasoning Year : 2009

A formally verified compiler back-end

(1, 2)
1
2

Abstract

This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Such a verified compiler is useful in the context of formal methods applied to the certification of critical software: the verification of the compiler guarantees that the safety properties proved on the source code hold for the executable compiled code as well.
Fichier principal
Vignette du fichier
paper2.pdf (701.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00360768 , version 1 (11-02-2009)
inria-00360768 , version 2 (21-07-2009)
inria-00360768 , version 3 (14-11-2009)

Identifiers

Cite

Xavier Leroy. A formally verified compiler back-end. Journal of Automated Reasoning, 2009, 43 (4), pp.363-446. ⟨10.1007/s10817-009-9155-4⟩. ⟨inria-00360768v3⟩

Collections

INRIA INRIA2 ANR
410 View
713 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More