Skip to main content

Compositionality Criteria for Defining Mixed-Styles Synchronous Languages

  • Conference paper
  • First Online:
Compositionality: The Significant Difference (COMPOS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1536))

Included in the following conference series:

  • 474 Accesses

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

This work has been partially supported by Esprit Long Term Research Project SYRF 22703

Verimag is a joint laboratory of Université Joseph Fourier (Grenoble I), CNRS and INPG

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. GĂ©rard Berry. The Constructive Semantics of Esterel. Draft book http://www.inria.fr/meij e/esterel, 1995.

  4. G. Berry and G. Gonthier. The Esterei synchronous programming language: Design, semantics, implementation. Science Of Computer Programming, 19(2):87–152, 1992.

    Article  MATH  Google Scholar 

  5. C2A-SYNCHRON. The common format of synchronous languages-The declarative code DC version 1.0. Technical report, SYNCHRON project, October 1995.

    Google Scholar 

  6. 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. 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. 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. F. Maraninchi. Operational and compositional semantics of synchronous automaton compositions. In CONCUR. LNCS 630, Springer Verlag, August 1992.

    Chapter  Google Scholar 

  10. 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. 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. 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. The synchronie workbench. http://set.gmd.de/SET/ees_f.html-GMD SET-EES, Schloss Birlinghoven, 53754 Sankt Augustin, Germany.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maraninchi, F., RĂ©mond, Y. (1998). Compositionality Criteria for Defining Mixed-Styles Synchronous Languages. In: de Roever, WP., Langmaack, H., Pnueli, A. (eds) Compositionality: The Significant Difference. COMPOS 1997. Lecture Notes in Computer Science, vol 1536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49213-5_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-49213-5_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65493-3

  • Online ISBN: 978-3-540-49213-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics