Skip to Main content Skip to Navigation

Compilation efficace d'un langage déclaratif synchrone : le générateur de code Lustre-V3

Abstract : This thesis presents the production of sequential code from the dataflow synchronous language Lustre. The main difficulty comes from the declarative style of the language: there is no explicit control statement in a Lustre program, so the whole control structure must be synthesized by the compiler. This synthesis consists in building a finite automaton by simulating the behaviour of boolean variables. The execution of the resulting code is very efficient: indeed, most of the boolean operations are performed at compile-time. On the other hand, the exhaustive aspect of this method can cause a real explosion of the code size. This problem can be due to the intrinsic complexity of the program source; in such a case, a compromise between execution time and memory size has to be found. But the explosion can also be caused by the building method, which often produces non minimal automata; we thus studied and developed a novel algorithm which always generates minimal automata. This algorithm requires a lot of symbolic manipulations of boolean functions, which were implemented efficiently by using binary decision diagrams.
Document type :
Complete list of metadatas
Contributor : Pascal Raymond <>
Submitted on : Tuesday, December 18, 2007 - 11:36:05 AM
Last modification on : Thursday, November 19, 2020 - 3:58:02 PM
Long-term archiving on: : Monday, April 12, 2010 - 8:10:44 AM


  • HAL Id : tel-00198546, version 1



Pascal Raymond. Compilation efficace d'un langage déclaratif synchrone : le générateur de code Lustre-V3. Langage de programmation [cs.PL]. Institut National Polytechnique de Grenoble - INPG, 1991. Français. ⟨tel-00198546⟩



Record views


Files downloads