P. Caspi
ABSTRACT
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.
- 1.E. A. Ashcroft and W. W. Wadge. LUCID, the Data- Flow Programming Language. Academic Press, 1985. Google Scholar
Digital Library
- 2.D. Austry and G. Boudol. Alg~bre de processus et synchronisation. Theor. Comp. Sci., 30(1):91-131, 1984.Google ScholarCross Ref
- 3.S. A. Babiker, R. A. Fleming, and R. E. Milne. A Tutorial for LTS. Technical Report 225.84.1, Standard Telecommunication Laboratories, 1984.Google Scholar
- 4.J-L. Bergerand. LUSTRE: Un langage d~elaratif pour le temps rdel. PhD thesis, University of Grenoble, 1986.Google Scholar
- 5.J-L. Bergerand, P. Caspi, N. Halbwachs, D. Pilaud, and E. Pilaud. Outline of a real-time data-flow language. In Real-time Systems Sumposium, pages 33-42, San Diego, 1985.Google Scholar
- 6.3-L. Bergerand, P. Caspi, N. Halbwa~hs, and J. A. Plaice. Automatic control systems programming using a real-time declarative language. In ~th IFAG/IFIP Symposium on Software/or Computer Control (SO- COCO), Graz, Austria, 1986.Google Scholar
- 7.G. Berry and L. Cosserat. The ESTEREL synchronous programming language and its mathematical semantics. In S. D. Brookes, A. W. Roscoe, and G. Winskel, editors, Seminar in Concurrency, Springer- Verlag, 1985. Google ScholarDigital Library
- 8.G. Berry and R. Sethl. From regular expressions to deterministic automata. To appear, 1986. Google ScholarDigital Library
- 9.C. Buore. Sgmantique op4rationnelle du langage LUS- TRE. Master's thesis, University of Grenoble, 1986.Google Scholar
- 10.E. Clarke, E. A. Emerson, and A. P. Sistla. Automarie verification o~ finite state concurrent spstems us. ing temporal logic specifications: a practical approach. Technical Report, Carnegie-Mellon, 1983. Google ScholarDigital Library
- 11.G. Gonthier. Private communication, 1985.Google Scholar
- 12.N. Halbwadas, A. Longchampt, and D. Pilaud. Describing and designing circuits by means of a synchronous declarative language. In IFIP Working Conference from HDL Descriptions to Guaranteed Correct Circuit Designs, Grenoble, 1986.Google Scholar
- 13.N. Halbwachs and D. Pilaud. From a real-time dataflow language to a multiple time-scale temporal logic. In preparation, 1986.Google Scholar
- 14.N. Halbwachs and D. Pilaud. Use of a real-time declarative language for systolic array design and simulation. In International Workshop on Systolic Arraps, Oxford, 1986.Google Scholar
- 15.D. Harel. Statecharts: a visual approach to complex systems. In Advanced NATO institute on Logics and Models for Verification and Specification of Concurrent Spstems, La CoUe-sur-Loup, France, 1984.Google Scholar
- 16.G. Kahn. The semantics of a simple language for parallel programming. In {FIP Congress, 1974,Google Scholar
- 17.P. le Guernic, A. Benveniste, P. Bournai, and T. Gautier. SIGNAL: a data-flow oriented language for signal procensing. Technical Report 378, INRIA, 1985.Google Scholar
- 18.J. R. McGraw. The Val language: description and eaaalysie. A CM Trans. on Prog. Lang. and Spat., 4(1):44-82, 1982. Google ScholarDigital Library
- 19.R. Milner. Calculi for synchrony and asynchrony. Theor. Comp. Sci., 25(3):267-310, 1983.Google ScholarCross Ref
- 20.G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19,/trhus University, 1981.Google Scholar
- 21.J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in cesar. In International Spmposium of Programming, Springer-Verlag, 1983. Google ScholarDigital Library
- 22.M. Sheeran. muFP, a language for VLSI design. In A CM Spmposium on Lisp and Functional Programming, Austin, Texas, 1984. Google ScholarDigital Library
Index Terms
- LUSTRE: a declarative language for real-time programming
Recommendations
A tactic language for declarative proofs
ITP'10: Proceedings of the First international conference on Interactive Theorem ProvingInfluenced by the success of the Mizar system many declarative proof languages have been developed in the theorem prover community, as declarative proofs are more readable, easier to modify and to maintain than their procedural counterparts. However, ...
Compile-time meta-programming in a dynamically typed OO language
DLS '05: Proceedings of the 2005 symposium on Dynamic languagesCompile-time meta-programming allows programs to be constructed by the user at compile-time. Although LISP derived languages have long had such facilities, few modern languages are capable of compile-time meta-programming, and of those that do many of ...
Comments