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.
Document type :
Preprints, Working Papers, ...
2007


https://hal.inria.fr/inria-00176007
Contributor : Laurence Rideau <>
Submitted on : Tuesday, October 2, 2007 - 11:15:14 AM
Last modification on : Tuesday, October 2, 2007 - 2:06:38 PM

Files

pmov.pdf
fileSource_public_author

Identifiers

  • HAL Id : inria-00176007, version 1

Collections

Citation

Laurence Rideau, Bernard Serpette, Xavier Leroy. Battling windmills with Coq: formal verification of a compilation algorithm for parallel moves. 2007. <inria-00176007>

Export

Share

Metrics

Consultation de
la notice

168

Téléchargement du document

74