Article Dans Une Revue Journal of Automated Reasoning Année : 2008

Formal verification of a C-like memory model and its uses for verifying program transformations

Résumé

This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Beyond giving semantics to pointer-based programs, this model supports reasoning over transformations of such programs. We show how the properties of the memory model are used to prove semantic preservation for three passes of the Compcert verified compiler

Fichier principal
Vignette du fichier
memory-model-journal.pdf (228.64 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

inria-00289542 , version 1 (21-06-2008)

Licence

Identifiants

Citer

Xavier Leroy, Sandrine Blazy. Formal verification of a C-like memory model and its uses for verifying program transformations. Journal of Automated Reasoning, 2008, 41 (1), pp.1-31. ⟨10.1007/s10817-008-9099-0⟩. ⟨inria-00289542⟩
690 Consultations
800 Téléchargements

Altmetric

Partager

  • More