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 Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

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

Résumé

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
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : inria-00176007 , version 1

Citer

Laurence Rideau, Bernard P. Serpette, Xavier Leroy. Battling windmills with Coq: formal verification of a compilation algorithm for parallel moves. 2007. ⟨inria-00176007⟩
157 Consultations
157 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More