The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The synchronous data flow programming language LUSTRE
Open accessAbstract
The authors describe LUSTRE, a data flow synchronous language designed for programming reactive systems-such as automatic control and monitoring systems-as well as for describing hardware. The data flow aspect of LUSTRE makes it very close to usual description tools in these domains (block-diagrams, networks of operators, dynamical sample-systems, etc.), and its synchronous interpretation makes it well suited for handling time in programs. Moreover, this synchronous interpretation allows it to be compiled into an efficient sequential program. The LUSTRE formalism is very similar to temporal logics. This allows the language to be used for both writing programs and expressing program properties, which results in an original program verification methodology.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
(1974) · IFIP Congress · Cited by 2,150
Model-checking for real-time systems
Alur, R., Courcoubetis, C., & Dill, D. (2002) · [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.1990.113766 · Cited by 897
On the Development of Reactive Systems
Harel, D., & Pnueli, A. (1985) · Logics and Models of Concurrent Systems · doi:10.1007/978-3-642-82453-1_17 · Cited by 859
Safety analysis of timing properties in real-time systems
Jahanian, F., & Mok, A. K.-L. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6313045 · Cited by 628
Memory-efficient algorithms for the verification of temporal properties
Courcoubetis, C., Vardi, M., Wolper, P., & Yannakakis, M. (1992) · Formal Methods in System Design · doi:10.1007/bf00121128 · Cited by 501
LUCID: The data flow programming language
Wadge, W. W., & Ashcroft, E. A. (1985) · Cited by 322
Alur, R., & Henzinger, T. A. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63473 · Cited by 162
Cited by
The nesC language: a holistic approach to networked embedded systems
Gay, D., Levis, P., von Behren, R., Welsh, M., Brewer, E., & Culler, D. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641652 · Cited by 1,631
StreamIt: A Language for Streaming Applications
Thies, W., Karczmarek, M., & Amarasinghe, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_14 · Cited by 1,104
Taming heterogeneity - the Ptolemy approach
Eker, J., Janneck, J. W., Lee, E. A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S., & Xiong, Y. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2002.805829 · Cited by 1,074
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781153 · Cited by 573
Distributed control applications within sensor networks
Sinopoli, B., Sharp, C., Schenato, L., Schaffert, S., & Sastry, S. S. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.814926 · Cited by 379
Metadata
- Authors
- Halbwachs, N., Caspi, P., Raymond, P., & Pilaud, D.
- Venue
- Proceedings of the IEEE
- Published
- 1991
- Volume
- 79
- Issue
- 9
- Pages
- 1305-1320
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2125415493
- Cited by
- 1,590
- References
- 9
- FWCI
- 13.39
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.