LUSTRE: a declarative language for real-time programming

Caspi, Paul; Pilaud, Daniel; Halbwachs, Nicolas; Plaice, John

doi:10.1145/41625.41641

Cited by 496 publications

(314 citation statements)

References 10 publications

Supporting

Mentioning

307

Contrasting

Unclassified

Order By: Relevance

“…In the current implementation, we make a compromise consistent with that made by other dataflow languages [4,5,16,18,19]. We provide a delay operator that reflects the value that its argument had at a specific interval in the past.…”

Section: Cyclesmentioning

confidence: 99%

“…An early language was Lucid [18], a pure, first-order dataflow language based on synchronous streams. Lustre [4] offers a similar programming model to that of Lucid, but with restrictions that support compilation to finite automata and real-time performance guarantees. Lustre also adds a notion of user-defined clocks, allowing streams to compute at different rates.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Embedding Dynamic Dataflow in a Call-by-Value Language

Cooper

Krishnamurthi

2006

Programming Languages and Systems

143

123

View full text Add to dashboard Cite

Abstract. This paper describes FrTime, an extension of Scheme designed for writing interactive applications. Inspired by functional reactive programming, the language embeds dynamic dataflow within a call-by-value functional language. The essence of the embedding is to make program expressions evaluate to nodes in a dataflow graph. This strategy eases importation of legacy code and permits incremental program construction. We have integrated FrTime with the DrScheme programming environment and have used it to develop several novel applications. We describe FrTime's design and implementation in detail and present a formal semantics of its evaluation model.

show abstract

Section: Cyclesmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Embedding Dynamic Dataflow in a Call-by-Value Language

Cooper

Krishnamurthi

2006

Programming Languages and Systems

143

123

View full text Add to dashboard Cite

show abstract

“…Another class of reactive languages are the synchronous languages such as Esterel [2], Lustre [3] and SIGNAL [6]. These languages are designed for reactive systems in which reaction is instantaneous.…”

Section: Related Workmentioning

confidence: 99%

Coordination of Many Agents

2005

View full text Add to dashboard Cite

Abstract. This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framework is a highly structured shared store in the form of a constraint logic program (CLP), which is used as a knowledge base and being reacted to by agents through the use of "reactors". The biggest challenge arising from such a reactive programming framework using CLP is to develop a trigger mechanism that allows efficient "wakeup" of blocked reactors. This paper addresses the architecture of this open framework, and discusses a general methodology for doing triggering of logic conditions using views and abstractions.

show abstract

“…Lustre is a description language for reactive systems which is based on the synchronous approach [10]. An algebraic semantics of Lustre has been stated and entered as a specification in LOFT.…”

Section: Other Formalismsmentioning

confidence: 99%

Testing can be formal, too

Gaudel

1995

TAPSOFT '95: Theory and Practice of Software Development

202

147

View full text Add to dashboard Cite

Abstract. The paper presents a theory of program testing based on formal specifications. The formal semantics of the specifications is the basis for a notion of an exhaustive test set. Under some minimal hypotheses on the program under test, the success of this test set is equivalent to the satisfaction of the specification. The selection of a finite subset of the exhaustive test set can be seen as the introduction of more hypotheses on the program, called selection hypotheses. Several examples of commonly used selection hypotheses are presented. Another problem is the observability of the results of a program with respect to its specification : contrary to some common belief, the use of a formal specification is not always sufficient to decide whether a test execution is a success. As soon as the specification deals with more abstract entities than the program, program results may appear in a form which is not obviously equivalent to the specificied results. A solution to this problem is proposed in the case of algebraic specifications.

show abstract

LUSTRE: a declarative language for real-time programming

Cited by 496 publications

References 10 publications

Embedding Dynamic Dataflow in a Call-by-Value Language

Embedding Dynamic Dataflow in a Call-by-Value Language

Coordination of Many Agents

Testing can be formal, too

Contact Info

Product

Resources

About