The synchronous data flow programming language LUSTRE

Halbwachs, Nicolas; Caspi, Paul; Raymond, Pascal; Pilaud, Daniel

doi:10.1109/5.97300

Cited by 1,251 publications

(714 citation statements)

References 14 publications

Supporting

Mentioning

702

Contrasting

Unclassified

Order By: Relevance

“…This structure mirrors synchronous digital circuitry: gates and wires do a finite amount of computation each clock cycle, but the system is assumed to run forever. The Lustre [12] synchronous language suggested this approach; we adapted it for a Haskell environment as presented by Hinze [13]. An advantage of our approach is that it does not require any new semantics: infinite streams were already lurking in our IR via lazy evaluation, which Haskell provides for us automatically.…”

Section: Sequential Ir: Streams For Timementioning

confidence: 99%

Hardware synthesis from a recursive functional language

Zhai¹,

Townsend²,

Lairmore³

et al. 2015

2015 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS)

View full text Add to dashboard Cite

Abstraction in hardware description languages stalled at the register-transfer level decades ago, yet few alternatives have had much success, in part because they provide only modest gains in expressivity. We propose to make a much larger jump: a compiler that synthesizes hardware from behavioral functional specifications. Our compiler translates general Haskell programs into a restricted intermediate representation before applying a series of semantics-preserving transformations, concluding with a simple syntax-directed translation to SystemVerilog. Here, we present the overall framework for this compiler, focusing on the intermediate representations involved and our method for translating general recursive functions into equivalent hardware. We conclude with experimental results that depict the performance and resource usage of the circuitry generated with our compiler.

show abstract

Section: Sequential Ir: Streams For Timementioning

confidence: 99%

Hardware synthesis from a recursive functional language

Zhai¹,

Townsend²,

Lairmore³

et al. 2015

2015 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS)

View full text Add to dashboard Cite

show abstract

“…This approach significantly differs from the one adopted for other synchronous languages such as Lustre or Signal which only evaluate parts of an overall dataflow graph depending on the status the system inputs ( [12], [11], [10]). …”

Section: General Descriptionmentioning

confidence: 99%

Cronos: a separate compilation tool set for modular esterel applications

Hainque

Pautet

Biannic

et al. 1999

FM’99 — Formal Methods

View full text Add to dashboard Cite

Abstract.Esterel is an imperative synchronous language designed for the specification and the development of reactive systems. Recent studies pointed out that its use for the development of avionics software can yield great benefits but that the lack of support for separate compilation in the current toolset may be an obstacle to the development of large systems. This paper presents the Cronos framework which provides such support for some specific cases of Esterel programs.

show abstract

“…The compiler takes care of translating the synchronous system into sequential (asynchronous) code while preserving its semantic [2]- [3]. Synchronous programming languages like ESTEREL [4], LUSTRE [5], SIGNAL [6], or SIMULINK are modular and compositional. This is essential for the programming of large control systems.…”

Section: Introductionmentioning

confidence: 99%

Distributing synchronous systems with modular structure

Zennaro

Sengupta

2004

2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)

View full text Add to dashboard Cite

Abstract-Synchronous programs were introduced to simplify the development of reactive systems hiding the complexity and indeterminism of the interleaving while taking full advantage of possible concurrency. The introduction of communication networks enabled the creation of distributed systems presenting the programmer with a new burden of interleaving and non determinism due to the asynchronous communication medium. Again this complexity should be hidden from the user while taking full advantage of the possible concurrency to improve performance. Many algorithms for the automatic distributions of synchronous programs have been proposed so far, but they are not suitable for large scale system because they do not preserve the compositionality of the original code: the modularity of the synchronous program is lost. As a result the subsystems are not re-usable and a small local change results in the recompilation and re-distribution of the overall system. This solution is cumbersome and unpractical in many real-world applications. In this paper we introduce an algorithm for the distribution of synchronous programs that preserves the modularity and allows separate compilation and subsystem re-use.

show abstract

The synchronous data flow programming language LUSTRE

Cited by 1,251 publications

References 14 publications

Hardware synthesis from a recursive functional language

Hardware synthesis from a recursive functional language

Cronos: a separate compilation tool set for modular esterel applications

Distributing synchronous systems with modular structure

Contact Info

Product

Resources

About