The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Mode-Automata: About Modes and States for Reactive Systems
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Synchronous Observers and the Verification of Reactive Systems
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Embedding Declarative Subprograms into Imperative Constructs
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Operational and Compositional Semantics of Synchronous Automaton Compositions
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Compiling ARGOS into Boolean Equations
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
| Hi-index | 0.00 |
This is not a paper about compositionality in itself, nor a general paper about mixing synchronous languages. We first recall that compositionality appears in three places in the definition of synchronous languages : 1) the synchrony hypothesis guarantees that the formal semantics of the language is compositional (in the sense that there exists an appropriate congruence) ; 2) programming environments offer separate compilation, at various levels ; 3) the idea of using synchronous observers for describing the properties of a program provides a kind of assume/guarantee scheme, thus enabling compositional proofs. Then we take an example in order to illustrate these good properties of synchronous languages : the idea is to extend a dataflow language like Lustre with a construct that supports the description of running modes. We show how to use compositionality arguments when choosing the semantics of a such a mixed-style language. The technical part is taken from [MR98].