Modular Compilation of Synchronous Programs

Schneider, Klaus; Brandt, Jens; Vecchié, au]Eric

doi:10.1007/978-0-387-39362-9_9

Cited by 7 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some works [24,26] address different notions of "modular compilation". In [26], the generated code is able to partially deal with undefined inputs by using a three-valued logic.…”

Section: Modularitymentioning

confidence: 99%

See 1 more Smart Citation

A higher-order extension for imperative synchronous languages

Vecchié¹,

Talpin²,

Boisgérault³

2010

Proceedings of the 13th International Workshop on Software &Amp; Compilers for Embedded Systems - SCOPES '10

View full text Add to dashboard Cite

This article presents the very first effective design of higherorder modules in the synchronous programming language Esterel. Higher-order modules, together with the robust separate compilation scheme that implements it, allow us to address a yet unexplored application spectrum ranging from rapid prototyping of embedded functionality to hot reconfiguration of embedded software within the formal modeling framework of the "synchronous hypothesis". While extensions of data-flow synchronous languages had already been proposed for Lustre [11] and Signal [25], the adaptation of similar programming concepts to imperative synchronous frameworks like Esterel has long posed major technical challenges, due to the specificity of its model of computation. We present a framework including a formal semantics, a type system, and a modular code generator, that tackle this challenge. We consider a specific stack-based module call convention and a simple event pooling protocol ; in consequence signals can refer to modules and modules can be transmitted and instantiated by referencing a signal. We define a type system that computes the potential emissions of a module and prove it sound. Our type system seamlessly fits an extension of Esterel's constructive semantics with higher-order modules.

show abstract

“…Some works [24,26] address different notions of "modular compilation". In [26], the generated code is able to partially deal with undefined inputs by using a three-valued logic.…”

Section: Modularitymentioning

confidence: 99%

“…The generated program tries to compute as many outputs as it can while ignoring inputs that are still unknown. In [24], the Esterel dialect Quartz is translated into a "job language". This translation can be conceptually regarded as a graph of simultaneously active jobs where each job contains an atomic task.…”

Section: Modularitymentioning

confidence: 99%

A higher-order extension for imperative synchronous languages

Vecchié¹,

Talpin²,

Boisgérault³

2010

Proceedings of the 13th International Workshop on Software &Amp; Compilers for Embedded Systems - SCOPES '10

View full text Add to dashboard Cite

show abstract

“…Different notions of "modular" compilation are studied in [11,10]. [11] consider the partial evaluation of Esterel programs: they generate code that tries to compute as many outputs as possible, while some inputs may be still unknown.…”

Section: Related Workmentioning

confidence: 99%

“…[11] consider the partial evaluation of Esterel programs: they generate code that tries to compute as many outputs as possible, while some inputs may be still unknown. [10] consider a language similar to Esterel called Quarz and its compilation to a target "job language".…”

Section: Related Workmentioning

confidence: 99%

Modularity vs. Reusability: Code Generation from Synchronous Block Diagrams

Lublinerman¹,

Tripakis²

2008

2008 Design, Automation and Test in Europe

View full text Add to dashboard Cite

We present several methods to generate modular code from synchronous hierarchical block diagrams. Modularity means code is generated for a given macro (i.e., composite) block independently from context, that is, without knowing where this block is to be used, and also with minimal knowledge about its sub-blocks. We achieve this by generating a set of interface functions for each block and a set of dependencies between these functions that is exported along with the interface. The main trade-off is the degree of modularity (number of interface functions) vs. reusability (the set of diagrams that the block can be used in without creating dependency cycles).

show abstract

“…Its efficient compilation has been a major issue for more than a decade [3], [1], [8]. More recently, the increasing complexity of systems and the need for integrating IPs (Intellectual Property) have motivated a renewed interest for the modular compilation of synchronous languages [10], [9], [7]. True modular compilation suits application area focusing on rapid prototyping, simulation and test or flexibility demands posed by the need for dynamic reconfigurability (e.g.…”

Section: Introductionmentioning

confidence: 99%

Separate compilation and execution of imperative synchronous modules

Vecchie¹,

Talpin²,

Schneider³

2009

2009 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition

View full text Add to dashboard Cite

Abstract-The compilation of imperative synchronous languages like Esterel has been widely studied, the separate compilation of synchronous modules has not, and remains a challenge. We propose a new compilation method inspired by traditional sequential code generation techniques to produce coroutines whose hierarchical structure reflects the control flow of the original source code. A minimalistic runtime system executes separately compiled modules.

show abstract

Modular Compilation of Synchronous Programs

Cited by 7 publications

References 21 publications

A higher-order extension for imperative synchronous languages

A higher-order extension for imperative synchronous languages

Modularity vs. Reusability: Code Generation from Synchronous Block Diagrams

Separate compilation and execution of imperative synchronous modules

Contact Info

Product

Resources

About