Skip to Main content Skip to Navigation
Conference papers

Arguments cadencés dans un compilateur Lustre vérifié

Timothy Bourke 1, 2, 3 Marc Pouzet 1, 2, 4, 3, 5
Abstract : Lustre is a synchronous language for programming systems as block diagrams from which low-level imperative code is generated automatically. Recent work applies the Coq interactive proof assistant to specify a compiler from a core subset of Lustre to the Clight input language of CompCert from which assembly code is generated. The overall correctness proof connects the stream semantics of Lustre to the imperative semantics of the assembly code. Every stream in a Lustre program is associated with a static ‘clock’ that represents when it is active. Compilation transforms the clocks into conditional statements that control when the corresponding value are calculated. Previous work made the simplifying assumption that the inputs and outputs of any given block shared the same static clock. This paper describes one way to lift this restriction. It requires enriching the static typing rules for clocks and the semantic model, and, to satisfy the Clight semantics, adding a compilation pass to ensure that any variable passed to a function call has been initialized.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-02005639
Contributor : Timothy Bourke <>
Submitted on : Monday, February 4, 2019 - 11:13:14 AM
Last modification on : Tuesday, May 4, 2021 - 2:06:02 PM
Long-term archiving on: : Sunday, May 5, 2019 - 1:45:08 PM

File

bourke-pouzet-jfla2019.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02005639, version 1

Citation

Timothy Bourke, Marc Pouzet. Arguments cadencés dans un compilateur Lustre vérifié. JFLA 2019 - Les Trentièmes Journées Francophones des Langages Applicatifs, Jan 2019, Les Rousses, France. pp.16. ⟨hal-02005639⟩

Share

Metrics

Record views

145

Files downloads

204