Specifying, programming and verifying real-time systems using a synchronous declarative language
Lecture notes in computer sciencePublished 1 January 1990Open access
Nicolas Halbwachs, D. Pilaud, F. Ouabdesselam, A-C. Glory
Citations42
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that the finite automaton produced by the Lustre compiler may be used for verifying many logical properties, by model checking, in the real-time system Lustre.
Abstract
We advocate the use of the synchronous declarative language Lustre as a unique language for specifying and programming real-time systems. Furthermore, we show that the finite automaton produced by the Lustre compiler may be used for verifying many logical properties, by model checking. The paper deals with an example program, extracted from a railways regulation system.
Keywords
Computer Science
ACM Transactions on Programming Languages and SystemsAutomatic verification of finite-state concurrent systems using temporal logic specifications
3,555 Citations1986E. M. Clarke, E. Allen Emerson +1 more
It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
Science of Computer ProgrammingThe Esterel synchronous programming language: design, semantics, implementation
1,715 Citations1992Gérard Berry, Georges Gonthier
This paper presents the imperative primitives of E esterel and the temporal manipulations they permit, and shows how the E Esterel v2 and V3 compilers efficiently translate concurrent E esteretl programs into efficient equivalent sequential automata that can be implemented in conventional sequential languages.
Theoretical Computer ScienceCalculi for synchrony and asynchrony
898 Citations1983Robin Milner
It is shown that the author's Calculus of Communicating Systems (1980), which is an asynchronous model, is derivable from the calculus presented here, which models both synchronous and asynchronous computation.
LUSTRE: a declarative language for real-time programming
550 Citations1987P. Caspi, D. Pilaud +2 more
This work describes its semantics by means of structural inference rules and shows how to use this semantics in order to generate efficient sequential code, namely, a finite state automaton which represents the control of the program.
LUSTRE: A declarative language for programming synchronous systems*
461 Citations1987Paul Caspi, D. Pilaud +2 more
This paper presents the language LUSTRE, whose main application field is the programming of automatic control and signal processing systems, and uses it as a basis for designing and programming these systems.
Lecture notes in computer scienceReasoning in interval temporal logic
92 Citations1984Ben Moszkowski, Zohar Manna
This paper discusses interval temporal logic (ITL), a formalism that augments standard predicate logic with operators for time-dependent concepts and compares ITL with the logic-based programming languages Lucid and Prolog.
OpenGrey (Institut de l'Information Scientifique et Technique)Synchronous programming of reactive systems: an introduction to ESTEREL
76 Citations1988Gérard Berry, Philippe Couronne +1 more
Sémantique et compilation de LUSTRE, un langage déclaratif synchrone
11 Citations1988John Plaice