Skip to main content
SpringerLink
Log in

Compositionality in dataflow synchronous languages: specification & code generation

  • 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:

Abstract

Modularity is advocated as a solution for the design of large systems, the mathematical translation of this concept is often that of compositionality. This paper is devoted the issues of compositionality aiming at modular code generation, for dataflow synchronous languages. As careless storing of object code for further reuse in systems design fails to work, we first concentrate on what are the additional features needed to abstract programs for the purpose of code generation: we show that a central notion is that of scheduling specification as resulting from a causality analysis of the given program. Then we study separate compilation for synchronous programs, and we discuss the issue of distributed implementation using an asynchronous medium of communication; for both topics we provide a complete formal study in the extended version [B1GA97] of this paper. Corresponding algorithms are currently under development in the framework of the DG+ common format for synchronous languages.

This work is or has been supported in part by the following projects: Eureka-SYNCHRON, Esprit R&D -SACRES (Esprit project EP 20897), Esprit LTR-SYRF (Esprit project EP 22703). In addition to the listed authors, the following people have indirectly, but strongly, contributed to this work: the STS formalism has been shamelessly borrowed from Amir Pnueli, and the background on labelled partial orders is mostly ackowledged to Paul Caspi.

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

Access this chapter

Log in via an institution
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 P. Le Guernic and P. Aubry, “Compositionality in dataflow synchronous languages: specification & code generation”, extended version of this paper, IRISA Research Report 1150, November 1997. http://www.irisa.fr/EXTERNE/bibli/pi/1150/1150.html

  2. I.J. Aabelsberg, and G. Rozenberg, Theory of traces, Theoretical Computer Science, 60, 1–82, 1988.

    Article  MathSciNet  Google Scholar 

  3. P. Aubry, “Mises en œuvre distribuées de programmes synchrones”, PhD Thesis, Univ. Rennes I, 1997.

    Google Scholar 

  4. A. Benveniste, G. Berry, “Real-Time systems design and programming”, Another look at real-time programming, special section of Proc. of the IEEE, vol. 9 n∘ 9, September 1991, 1270–1282.

    Google Scholar 

  5. A. Benveniste, P. Le Guernic, and C. Jacquemot. Synchronous programming with events and relations: the SIGNAL languages and its semantics. Sci. Comp. Prog., 16:103–149, 1991.

    Article  MATH  Google Scholar 

  6. A. Benveniste, P. Caspi, N. Halbwachs, and P. Le Guernic, Dataflow synchronous languages. In A Decade of Concurrency, reflexions and perspectives, REX School/Symposium, pages 1–45, LNCS Vol. 803, Springer Verlag, 1994.

    Google Scholar 

  7. Gérard Berry, The Constructive Semantics of Esterel, Draft book, http://www. inria. fr/meije/esterel, December 1995.

  8. B. Caillaud, P. Caspi, A. Giraud, and C. Jard, “Distributing automata for asynchronous networks of processors”, European Journal on Automated Systems (JESA), Hermes, 31(3), 503–524, May 1997.

    Google Scholar 

  9. M. Clerbout, and M. Latteux, Semi-commutations, Information and Computation, 73, 59–74, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  10. Sacres Consortium, The Declarative Code DC+, Version 1.2, May 1996; Esprit project EP 20897: Sacres.

    Google Scholar 

  11. N. Halbwachs, Synchronous programming of reactive systems,. Kluwer Academic Pub., 1993.

    Google Scholar 

  12. Y. Kesten and A. Pnueli, An αSTS-based common semantics for signal and Statecharts, March 1996. Sacres Manuscript.

    Google Scholar 

  13. L. Lamport, Specifying concurrent program modules, ACM Trans, on Prog. Lang, and Sys., 5(2):190–222, 1983.

    Article  MATH  Google Scholar 

  14. L. Lamport, What good is temporal logic? In Proc. IFIP 9th World Congress, R.E.A. Mason (Ed.), North Holland, 657–668, 1983.

    Google Scholar 

  15. P. Le Guernic, T. Gautier, M. Le Borgne, C. Le Maire, “Programming real-time applications with Signal”, Another look at real-time programming, special section of Proc. of the IEEE, vol. 9 n∘ 9, September 1991, 1321–1336.

    Google Scholar 

  16. O. Maffeis and P. Le Guernic, “Distributed implementation of Signal: scheduling and graph clustering”, in: 3rd International School and Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Lecture Notes in Computer Science 863, Springer Verlag, 149–169, Sept. 1994.

    Google Scholar 

  17. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1992.

    Google Scholar 

  18. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Safety. Springer-Verlag, New York, 1995.

    Google Scholar 

  19. A. Pnueli, personal communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Irisa/Inria, Campus de Beaulieu, 35042, Rennes cedex, France

    Albert Benveniste & Paul Le Guernic

  2. Irisa/Ifsic, Campus de Beaulieu, 35042, Rennes cedex, France

    Pascal Aubry

Authors
  1. Albert Benveniste
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul Le Guernic
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pascal Aubry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics and Applied Mathematics, Christian Albrechts University at Kiel, Preußerstr. 1-9, D-24105, Kiel, Germany

    Willem-Paul de Roever  & Hans Langmaack  & 

  2. Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, P.O. Box 26, Rehovot, 76100, Israel

    Amir Pnueli

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benveniste, A., Le Guernic, P., Aubry, P. (1998). Compositionality in dataflow synchronous languages: specification & code generation. 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_3

Download citation

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

  • 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

Search

Navigation