Skip to main content

Aspects of Designing and Implementing a Synchronous Programming Language

  • Chapter
Informatik als Dialog zwischen Theorie und Anwendung
  • 937 Accesses

Abstract

Several aspects of the design and implementation of the synchronous language synERJY are discussed ranging from proof of correctness to timing considerations on μ-processors.

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 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

  • Berry, Gerard: A Hardware Implementation of Pure Esterel. Rapports de Recherche 1479 1479, INRIA, 1991.

    Google Scholar 

  • Berry, Gerard: The Semantics of Pure Esterel. In: Broy, Manfred (editor): Program Design Calculi, volume 118 of Series F: Computer and System Sciences of series NATO ASI Series, 1993.

    Google Scholar 

  • Berry, Gerard and Georges Gonthier: The Esterel synchronous programming language: design, semantics, implementation. Science of Computer Programming, 19(2):87–152, 1992.

    Article  MATH  Google Scholar 

  • Budde, Reinhard, Axel Poigné and Karl-Heinz Sylla: synERJY An Object-oriented Synchronous Language. Electronic Notes in Theoretical Computer Science, 2006.

    Google Scholar 

  • Cousineau, Guy, Pierre-Louis Curien and Michel Mauny: The Categorical Abstract Machine. Science of Computer Programming, 1987.

    Google Scholar 

  • Clarke, E.M., E.A. Emerson and A.P. Sistla: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM transactions on Programming Languages and Systems, 8(2):244–263, 1986.

    Article  MATH  Google Scholar 

  • Emerson, E. and J. Halpern: “Sometimes” and “not never” revisited: on branching versus linear time temporal logic. Journal of the ACM, 1986.

    Google Scholar 

  • Gonthier, Georges: Sémantique et modès d’ex’ecution des languages réactifs synchrones; application à Esterel. Doktorarbeit, Université d’Orsay, 1988.

    Google Scholar 

  • Harel, David: Statecharts: A visual approach to complex systems. Science of Computer Programming, 8:231–274, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  • Halbwachs, Nicholas, Paul Caspi, Pascal Raymond and Daniel Pilaud: The Synchronous Dataflow Programming Language Lustre. Proc. of the IEEE, 79(9), 1991.

    Google Scholar 

  • Malik, Sharad: Analysis of cyclic combinational circuits. In: 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993.

    Google Scholar 

  • Mignard, Frédéric: Compilation du langage Esterel en systèmes d’équations booléennes. Doktorarbeit, École des Mines, Paris, 1994.

    Google Scholar 

  • NuSMV: a new symbolic model checker, http://nusmv.irst.itc.it

  • Poigné, Axel and Hagen Huwig: Ein rekursionsorientierte Einführung in eine ALGOL 68 - ähnliche Sprache. Bericht 46, Abt. Informatik, Universität Dortmund, Dortmund, 1977.

    Google Scholar 

  • ***Poigné, Axel and Leszek Holenderski: Boolean Automata for Implementing Pure Esterel. Arbeitspapiere der GMD 964, GMD, 1995.

    Google Scholar 

  • PoignÉ, Axel and Leszek Holenderski: On the combination of synchronous languages. In: de Roever, W. P. (editor):Workshop on Compositionality: The Significant Difference, volume 1536 of series LNCS, pages 490–514, Malente, September 1997. Springer Verlag.

    Google Scholar 

  • Plotkin, Gordon D.: A Structural Approach to Operational Semantics. Tech. Rep. DAIMI FN 19, Aarhus University, 1981.

    Google Scholar 

  • Poigné, Axel, Matthew Morley, Olivier Maffeïs and Leslek Holenderski: The synchronous approach to designing reactive systems. Formal Methods in System Design, V:1–25, 1998.

    Google Scholar 

  • Poigné, Axel: Teaching Programming Languages. Bericht 41, Abteilung Informatik, Universität Dortmund, 1977.

    Google Scholar 

  • Poigné, Axel and Josef Voss: On the implementation of abstract data types by programming language constructs. Journal of Computer and System Sciences, 34(2/3):340–376, 1987.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Authors

Editor information

Volker Diekert Karsten Weicker Nicole Weicker

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Vieweg+Teubner | GWV Fachverlage GmbH

About this chapter

Cite this chapter

Poigné, A. (2009). Aspects of Designing and Implementing a Synchronous Programming Language. In: Diekert, V., Weicker, K., Weicker, N. (eds) Informatik als Dialog zwischen Theorie und Anwendung. Vieweg+Teubner. https://doi.org/10.1007/978-3-8348-9982-8_16

Download citation

Publish with us

Policies and ethics