Abstraction of Clocks in Synchronous Data-Flow Systems

ion of Clocks in Synchronous Data-flow Systems Albert Cohen1 , Louis Mandel2 , Florence Plateau2 , and Marc Pouzet23 1 INRIA Saclay - Ile-de-France, Orsay, France 2 LRI, Univ. Paris-Sud 11, Orsay, France and INRIA Saclay 3 Institut Universitaire de France Abstract. Synchronous data-flow languages such as Lustre manage infinite sequences or streams as basic values. Each stream is associated to a clock which defines the instants where the current value of the stream is present. This clock is a type information and a dedicated type system -- the so-called clock-calculus -- statically rejects programs which cannot be executed synchronously. In existing synchronous languages, it amounts at asking whether two streams have the same clocks and thus relies on clock equality only. Recent works have shown the interest of introducing some relaxed notion of synchrony, where two streams can be composed as soon as they can be synchronized through the introduction of a finite buffer (as done in the SD...

• Type: Conference
• Year: 2008
• Where: APLAS
• Authors: Albert Cohen, Louis Mandel, Florence Plateau, Marc Pouzet
• Keywords: APLAS 2008, Clock, Clock Envelopes, Programming Languages, Synchronous Data-flow