Skip to Main content Skip to Navigation

Application of Interface Theories to the Separate Compilation of Synchronous Programs

Albert Benveniste 1 Benoît Caillaud 1 Raclet Jean-Baptiste 2 
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We study the problem of separate compilation, i.e., the generation of modular code, for the discrete time part of block-diagrams formalisms such as Simulink, Modelica, or Scade. Code is modular in that it is generated for a given composite block independently from context (i.e., without knowing in which diagrams the block is to be used) and using minimal information about the internals of the block. Just using o -the-shelf C code generation (e.g., as available in Simulink) does not provide modular code. Separate compilation was solved by Lublinerman et al. for the special case of single-clocked diagrams, in which all signals are updated at a same unique clock. For the same case, Pouzet and Raymond proposed algorithms that scale-up properly to real-size applications. The technique of Lublinerman et al. was extended to some classes of multi-clocked and timed diagrams. We study this problem in its full generality and we show that it can be cast to a special class of controller synthesis problems by relying on recently proposed modal interface theories.
Document type :
Complete list of metadata
Contributor : Albert Benveniste Connect in order to contact the contributor
Submitted on : Thursday, July 26, 2012 - 2:35:15 PM
Last modification on : Wednesday, June 1, 2022 - 5:15:00 AM
Long-term archiving on: : Friday, December 16, 2016 - 3:43:54 AM


Files produced by the author(s)


  • HAL Id : hal-00721049, version 1


Albert Benveniste, Benoît Caillaud, Raclet Jean-Baptiste. Application of Interface Theories to the Separate Compilation of Synchronous Programs. [Research Report] RR-8030, INRIA. 2012. ⟨hal-00721049⟩



Record views


Files downloads