Compositionality Criteria for Defining Mixed-Styles Synchronous Languages

  • Florence Maraninchi
  • Yann Rémond
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1536)

Abstract

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].

Keywords

Parallel Composition Object Code Mealy Machine Synchronous Language Compositionality Criterion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BB91]
    A. Benveniste and G. Berry. Another look at real-time programming. Special Section of the Proceedings of the IEEE, 79(9), September 1991.Google Scholar
  2. [BCH+85]_J-L. Bergerand, P. Caspi, N. Halbwachs, D. Pilaud, and E. Pilaud. Outline of a real time data-flow language. In Real Time Systems Symposium, San Diego, September 1985.Google Scholar
  3. [Ber95]
    Gérard Berry. The Constructive Semantics of Esterel. Draft book http://www.inria.fr/meij e/esterel, 1995.
  4. [BG92]
    G. Berry and G. Gonthier. The Esterei synchronous programming language: Design, semantics, implementation. Science Of Computer Programming, 19(2):87–152, 1992.MATHCrossRefGoogle Scholar
  5. [CS95]
    C2A-SYNCHRON. The common format of synchronous languages-The declarative code DC version 1.0. Technical report, SYNCHRON project, October 1995.Google Scholar
  6. [HLR93]
    N. Halbwachs, F. Lagnier, and P. Raymond. Synchronous observers and the verification of reactive systems. In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Third Int. Conf. on Algebraic Methodology and Software Technology, AMAST’93, Twente, June 1993. Workshops in Computing, Springer Verlag.Google Scholar
  7. [JLMR93]
    M. Jourdan, F. Lagnier, F. Maraninchi, and P. Raymond. Embedding declarative subprograms into imperative constructs. In Fifth International Symposium on Programming Language Implementation and Logic Programming, Tallin, Estonia. Springer Verlag, LNCS 714, August 1993.Google Scholar
  8. [JLMR94]
    M. Jourdan, F. Lagnier, F. Maraninchi, and P. Raymond. A multiparadigm language for reactive systems. In In 5th IEEE International Conference on Computer Languages, Toulouse, May 1994. IEEE Computer Society Press.Google Scholar
  9. [Mar92]
    F. Maraninchi. Operational and compositional semantics of synchronous automaton compositions. In CONCUR. LNCS 630, Springer Verlag, August 1992.CrossRefGoogle Scholar
  10. [MH96]
    F. Maraninchi and N. Halbwachs. Compiling argos into boolean equations. In Formal Techniques for Real-Time and Fault Tolerance (FTRTFT), Uppsala (Sweden), September 1996. Springer verlag, LNCS 1135.Google Scholar
  11. [MMVR95]
    Martin Müller, Tobias Müller, and Peter Van Roy. Multi-paradigm programming in Oz. In Donald Smith, Olivier Ridoux, and Peter Van Roy, editors, Visions for the Future of Logic Programming: Laying the Foundations for a Modern successor of Prolog, Portland, Oregon, 7 December 1995. A Workshop in Association with ILPS’95.Google Scholar
  12. [MR98]
    F. Maraninchi and Y. Rémond. Mode-automata: About modes and states for reactive systems. In European Symposium On Programming, Lisbon (Portugal), March 1998. Springer Verlag.Google Scholar
  13. [SWB]
    The synchronie workbench. http://set.gmd.de/SET/ees_f.html-GMD SET-EES, Schloss Birlinghoven, 53754 Sankt Augustin, Germany.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Florence Maraninchi
    • 1
  • Yann Rémond
    • 1
  1. 1.Centre EquationVERIMAGGieres

Personalised recommendations