A Formally Verified Compiler for Lustre - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

A Formally Verified Compiler for Lustre


The correct compilation of block diagram languages like Lustre, Scade, and a discrete subset of Simulink is important since they are used to program critical embedded control software. We describe the specification and verification in an Interactive Theorem Prover of a compilation chain that treats the key aspects of Lustre: sampling, nodes, and delays. Building on CompCert, we show that repeated execution of the generated assembly code faithfully implements the dataflow semantics of source programs. We resolve two key technical challenges. The first is the change from a synchronous dataflow semantics, where programs manipulate streams of values, to an imperative one, where computations manipulate memory sequentially. The second is the verified compilation of an imperative language with encapsulated state to C code where the state is realized by nested records. We also treat a standard control optimization that eliminates unnecessary conditional statements.
Fichier principal
Vignette du fichier
velus-pldi17.pdf (466.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01512286 , version 1 (22-04-2017)


  • HAL Id : hal-01512286 , version 1


Timothy Bourke, Lélio Brun, Pierre-Evariste Dagand, Xavier Leroy, Marc Pouzet, et al.. A Formally Verified Compiler for Lustre. PLDI 2017 - 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, Jun 2017, Barcelone, Spain. ⟨hal-01512286⟩
2004 View
2062 Download


Gmail Facebook X LinkedIn More