Battling windmills with Coq: formal verification of a compilation algorithm for parallel moves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

Battling windmills with Coq: formal verification of a compilation algorithm for parallel moves

Abstract

This article describes the formal verification of a compilation algorithm that transforms parallel moves (parallel assignments between variables) into a semantically-equivalent sequence of elementary moves. Two different specifications of the algorithm are given: an inductive specification and a functional one, each with its correctness proofs. A functional program can then be extracted and integrated in the Compcert verified compiler.
Fichier principal
Vignette du fichier
pmov.pdf (238.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00176007 , version 1 (02-10-2007)

Identifiers

  • HAL Id : inria-00176007 , version 1

Cite

Laurence Rideau, Bernard P. Serpette, Xavier Leroy. Battling windmills with Coq: formal verification of a compilation algorithm for parallel moves. 2007. ⟨inria-00176007⟩
143 View
135 Download

Share

Gmail Facebook Twitter LinkedIn More