Synchronous programming with events and relations: the SIGNAL language and its semantics
Science of Computer Programming
Compiling with continuations
Proceedings of the first ACM SIGPLAN international conference on Functional programming
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular resetting of synchronous data-flow programs
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Letters to the editor: go to statement considered harmful
Communications of the ACM
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Mode-automata: a new domain-specific construct for the development of safe critical systems
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
A conservative extension of synchronous data-flow with state machines
Proceedings of the 5th ACM international conference on Embedded software
Synchronous objects with scheduling policies: introducing safe shared memory in lustre
Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Machine-Checked Sequencer for Critical Embedded Code Generator
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Use of formal methods for building qualified code generator for safer automotive systems
Proceedings of the 1st Workshop on Critical Automotive applications: Robustness & Safety
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Automatic generation of hardware/software interfaces
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Journal of Systems Architecture: the EUROMICRO Journal
Zélus: a synchronous language with ODEs
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
Synchronous data-flow languages such as SCADE LUSTRE manage infinite sequences, or streams, as primitive values making them naturally adapted to the description of dominated systems. Their conservative extension with means to define control-structures or modes has been a long-term research topic through which several solutions have emerged.In this paper, we pursue this effort and generalize existing solutions by providing two constructs: a general form of state machines called parameterized state machines, and valued signals, as can be found in ESTEREL. Parameterized state machines greatly reduce the reliance on error-prone mechanisms such as shared memory in automaton-based programming. Signals provide a new way of programming with multi-rate data in synchronous dataflow languages. Together, they allow for a much more direct and natural programming of systems that combine dataflow and state-machines.The proposed extension is fully implemented in the new LUCID SYNCHRONE compiler.