论文信息 - Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves

Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves

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.

Xavier Leroy | Bernard P. Serpette | Laurence Rideau

[1] Pierre Castéran,et al. Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[2] Gilles Barthe,et al. Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant , 2006, FLOPS.

[3] Andrew W. Appel,et al. Compiling with Continuations , 1991 .

[4] Ravi Sethi. A Note on Implementing Parallel Assignment Instructions , 1973, Inf. Process. Lett..

[5] Pierre Letouzey,et al. A New Extraction for Coq , 2002, TYPES.

[6] Xavier Leroy,et al. Formal certification of a compiler back-end or: programming a compiler with a proof assistant , 2006, POPL '06.

[7] Benjamin Grégoire,et al. A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis , 2004, TYPES.

[8] Peter H. Welch. Parallel assignment revisited , 1983, Softw. Pract. Exp..

[9] Cathy May,et al. The Parallel Assignment Problem Redefined , 1989, IEEE Trans. Software Eng..

[10] Jean-Christophe Filliâtre,et al. Verification of non-functional programs using interpretations in type theory , 2003, J. Funct. Program..

[11] Xavier Leroy,et al. Formal Verification of a C Compiler Front-End , 2006, FM.

[12] Christine Paulin-Mohring,et al. The Coq Proof Assistant A Tutorial , 2005 .