More Web Proxy on the site http://driver.im/

Article

Free access

LUSTRE: a declarative language for real-time programming

Authors:

J. A. PlaiceAuthors Info & Claims

POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Pages 178 - 188

https://doi.org/10.1145/41625.41641

Published: 01 October 1987 Publication History

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.

References

[1]

E. A. Ashcroft and W. W. Wadge. LUCID, the Data- Flow Programming Language. Academic Press, 1985.

Digital Library

[2]

D. Austry and G. Boudol. Alg~bre de processus et synchronisation. Theor. Comp. Sci., 30(1):91-131, 1984.

[3]

S. A. Babiker, R. A. Fleming, and R. E. Milne. A Tutorial for LTS. Technical Report 225.84.1, Standard Telecommunication Laboratories, 1984.

[4]

J-L. Bergerand. LUSTRE: Un langage d~elaratif pour le temps rdel. PhD thesis, University of Grenoble, 1986.

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

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

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

Digital Library

[8]

G. Berry and R. Sethl. From regular expressions to deterministic automata. To appear, 1986.

Digital Library

[9]

C. Buore. Sgmantique op4rationnelle du langage LUS- TRE. Master's thesis, University of Grenoble, 1986.

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

Digital Library

[11]

G. Gonthier. Private communication, 1985.

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

[13]

N. Halbwachs and D. Pilaud. From a real-time dataflow language to a multiple time-scale temporal logic. In preparation, 1986.

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

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

[16]

G. Kahn. The semantics of a simple language for parallel programming. In {FIP Congress, 1974,

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

[18]

J. R. McGraw. The Val language: description and eaaalysie. A CM Trans. on Prog. Lang. and Spat., 4(1):44-82, 1982.

Digital Library

[19]

R. Milner. Calculi for synchrony and asynchrony. Theor. Comp. Sci., 25(3):267-310, 1983.

[20]

G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19,/trhus University, 1981.

[21]

J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in cesar. In International Spmposium of Programming, Springer-Verlag, 1983.

Digital Library

[22]

M. Sheeran. muFP, a language for VLSI design. In A CM Spmposium on Lisp and Functional Programming, Austin, Texas, 1984.

Digital Library

Cited By

Eymer JDexter PRaskind JLiu Y(2024)A Runtime System for Interruptible Query Processing: When Incremental Computing Meets Fine-Grained ParallelismProceedings of the ACM on Programming Languages10.1145/36897728:OOPSLA2(1729-1756)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689772
Chen Jde Mendonça JAyele BBekele BJalili SSharma PWohlfeil NZhang YJeannin J(2024)Synchronous Programming with Refinement TypesProceedings of the ACM on Programming Languages10.1145/36746578:ICFP(938-972)Online publication date: 15-Aug-2024
https://dl.acm.org/doi/10.1145/3674657
Broy M(2024)A Calculus for the Specification, Design, and Verification of Distributed Concurrent SystemsFormal Aspects of Computing10.1145/367208536:3(1-54)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3672085
Show More Cited By

Index Terms

LUSTRE: a declarative language for real-time programming

Recommendations

Extending database programming language with declarative querying facilities
A tactic language for declarative proofs
ITP'10: Proceedings of the First international conference on Interactive Theorem Proving

Influenced 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 languages

Compile-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

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

October 1987

326 pages

ISBN:0897912152

DOI:10.1145/41625

Copyright © 1987 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL87

Sponsor:

SIGPLAN

POPL87: Fourteenth Annual ACM SIGACT-SIGPLAN Symposium on Prnciples of Programming Languages

January 21 - 23, 1987

Munich, West Germany

Acceptance Rates

POPL '87 Paper Acceptance Rate 29 of 108 submissions, 27%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

450
Total Citations
View Citations
2,374
Total Downloads

Downloads (Last 12 months)302
Downloads (Last 6 weeks)78

Reflects downloads up to 10 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Eymer JDexter PRaskind JLiu Y(2024)A Runtime System for Interruptible Query Processing: When Incremental Computing Meets Fine-Grained ParallelismProceedings of the ACM on Programming Languages10.1145/36897728:OOPSLA2(1729-1756)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689772
Chen Jde Mendonça JAyele BBekele BJalili SSharma PWohlfeil NZhang YJeannin J(2024)Synchronous Programming with Refinement TypesProceedings of the ACM on Programming Languages10.1145/36746578:ICFP(938-972)Online publication date: 15-Aug-2024
https://dl.acm.org/doi/10.1145/3674657
Broy M(2024)A Calculus for the Specification, Design, and Verification of Distributed Concurrent SystemsFormal Aspects of Computing10.1145/367208536:3(1-54)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3672085
Zhang YMallet FZhang MLiu Z(2024)Specification and Verification of Multi-Clock Systems Using a Temporal Logic with Clock ConstraintsFormal Aspects of Computing10.1145/367079436:2(1-51)Online publication date: 8-Jun-2024
https://dl.acm.org/doi/10.1145/3670794
Prasad S(2024)Logical Synchrony Plus Functional Processes Entail Observable Determinacy2024 22nd ACM-IEEE International Symposium on Formal Methods and Models for System Design (MEMOCODE)10.1109/MEMOCODE63347.2024.00012(63-68)Online publication date: 3-Oct-2024
https://doi.org/10.1109/MEMOCODE63347.2024.00012
Kausch HPfeiffer MRaco DRumpe BSchweiger A(2024)Model-driven development for functional correctness of avionics systems: a verification framework for SysML specificationsCEAS Aeronautical Journal10.1007/s13272-024-00762-6Online publication date: 21-Oct-2024
https://doi.org/10.1007/s13272-024-00762-6
Li WRibeiro PMiyazawa ARedpath RCavalcanti AAlden KWoodcock JTimmis J(2024)Formal design, verification and implementation of robotic controller software via RoboChart and RoboToolAutonomous Robots10.1007/s10514-024-10163-748:6Online publication date: 5-Jul-2024
https://doi.org/10.1007/s10514-024-10163-7
Perez IGoodloe ADedden F(2024)Runtime Verification in Real-Time with the Copilot Language: A TutorialFormal Methods10.1007/978-3-031-71177-0_27(469-491)Online publication date: 13-Sep-2024
https://doi.org/10.1007/978-3-031-71177-0_27
Ishii D(2024)A Hypergraph-Based Formalization of Hierarchical Reactive Modules and a Compositional Verification MethodModel Checking Software10.1007/978-3-031-66149-5_4(67-84)Online publication date: 13-Oct-2024
https://doi.org/10.1007/978-3-031-66149-5_4
Rozier KDureja RIrfan AJohannsen CNukala KShankar NTinelli CVardi M(2024)MoXI: An Intermediate Language for Symbolic Model CheckingModel Checking Software10.1007/978-3-031-66149-5_2(26-46)Online publication date: 13-Oct-2024
https://doi.org/10.1007/978-3-031-66149-5_2
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents