Lucy-n: a n-Synchronous Extension of Lustre

Lucy-n: a n-Synchronous Extension of Lustre,10.1007/978-3-642-13321-3_17,Louis Mandel,Marc Pouzet

Lucy-n: a n-Synchronous Extension of Lustre   (Citations: 1)
BibTex | RIS | RefWorks Download
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buer. Every expression is associated to a clock in- dicating the instants when a value is present. A dedicated type system, the clock calculus, checks that the actual clock of a stream equals its ex- pected clock and thus does not need to be buered. The n-synchrony re- laxes synchrony by allowing the communication through bounded buers whose size is computed at compile-time. It is obtained by extending the clock calculus with a subtyping rule which defines buering points. This paper presents the first implementation of the n-synchronous model inside a Lustre-like language called Lucy-n. The language extends Lustre with an explicit buffer construct whose size is automatically computed during the clock calculus. This clock calculus is defined as an inference type system and is parametrized by the clock language and the algorithm used to solve subtyping constraints. We detail here one algorithm based on the abstraction of clocks, an idea originally introduced in (5). The paper presents a simpler, yet more precise, clock abstraction for which the main algebraic properties have been proved in Coq. Finally, we illustrate the language on various examples including a video application.
Conference: Mathematics of Program Construction - MPC , pp. 288-309, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: