LUSTRE

LUSTRE: a declarative language for real-time programming. LUSTRE is a synchronous data-flow language for programming systems which interact with their environments in real-time. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we show how to use this semantics in order to generate efficient sequential code, namely, a finite state automaton which represents the control of the program. Formal rules for program transformation are also presented.

This software is also peer reviewed by journal TOMS.


References in zbMATH (referenced in 22 articles )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Ghosh, Kamalesh; Dasgupta, Pallab; Ramesh, S.: Automated planning as an early verification tool for distributed control (2015)
  2. Motika, Christian; von Hanxleden, Reinhard: Light-weight synchronous Java (SJL): an approach for programming deterministic reactive systems with Java (2015)
  3. Bae, Kyungmin; Ölveczky, Peter Csaba; Feng, Thomas Huining; Lee, Edward A.; Tripakis, Stavros: Verifying hierarchical Ptolemy II discrete-event models using real-time maude (2012)
  4. Hatcliff, John; Leavens, Gary T.; Leino, K.Rustan M.; Müller, Peter; Parkinson, Matthew: Behavioral interface specification languages (2012)
  5. Mandel, Louis; Plateau, Florence: Scheduling and buffer sizing of n-synchronous systems. Typing of ultimately periodic clocks in Lucy-n (2012)
  6. Schrammel, Peter; Jeannet, Bertrand: Applying abstract acceleration to (co-)reachability analysis of reactive programs (2012)
  7. Lescaylle, Alexei; Villanueva, Alicia: Bridging the gap between two concurrent constraint languages (2011)
  8. Rocha, Camilo; Muñoz, César; Dowek, Gilles: A formal library of set relations and its application to synchronous languages (2011)
  9. Mandel, Louis; Plateau, Florence; Pouzet, Marc: Lucy-n: a n-synchronous extension of Lustre (2010)
  10. Field, John; Marinescu, Maria-Cristina; Stefansen, Christian: Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications (2009)
  11. Jacquet, Jean-Marie; Linden, Isabelle: Fully abstract models and refinements as tools to compare agents in timed coordination languages (2009)
  12. Lublinerman, Roberto; Szegedy, Christian; Tripakis, Stavros: Modular code generation from synchronous block diagrams: modularity vs. code size (2009)
  13. MacQueen, David B.: Kahn networks at the dawn of functional programming (2009)
  14. Alpuente, M.; Gallardo, M.M.; Pimentel, E.; Villanueva, A.: An abstract analysis framework for synchronous concurrent languages based on source-to-source transformation (2007)
  15. Linden, I.; Jacquet, J.-M.; De Bosschere, K.; Brogi, A.: On the expressiveness of timed coordination models (2006)
  16. Bertrane, Julien: Static analysis by abstract interpretation of the quasi-synchronous composition of synchronous programs (2005)
  17. Edwards, Stephen A.; Lee, Edward A.: The semantics and execution of a synchronous block-diagram language. (2003)
  18. Quinton, Patrice; Risset, Tanguy: Structured scheduling of recurrence equations: Theory and practice (2002)
  19. Cousot, Patrick; Cousot, Radhia: Verification of embedded software: Problems and perspectives (2001)
  20. Dupuy-Chessa, Sophie; du Bousquet, Lydie: Validation of UML models thanks to Z and Lustre (2001)

1 2 next