Tilting at 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
Journal Articles Journal of Automated Reasoning Year : 2008

Tilting at 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
parallel-move.pdf (185.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00289709 , version 1 (23-06-2008)

Identifiers

Cite

Laurence Rideau, Bernard P. Serpette, Xavier Leroy. Tilting at windmills with Coq: formal verification of a compilation algorithm for parallel moves. Journal of Automated Reasoning, 2008, 40 (4), pp.307-326. ⟨10.1007/s10817-007-9096-8⟩. ⟨inria-00289709⟩
260 View
266 Download

Altmetric

Share

Gmail Facebook X LinkedIn More