GC: the Data-Flow Graph Format for Synchronous Programming

Soumis par Pascal Aubry le dim, 01/01/1995 - 00:00

Based on an abstraction of the time as a discrete logical time, the synchronous languages, armed with a strong semantics, enable the design of safe real-time applications. Some of them are of imperative style, while others are declarative. Academic and industrial teams involved in synchronous programming defined together three intermediate representations, on the way to standardization:

IC, a parallel format of imperative style,
GC, a parallel format of data-flow style,
OC, a sequential format to describe automata.

In this paper, we describe more specifically the format GC, and its links with the synchronous data-flow language \signal. Thanks to the first experimentations, GC reveals itself as a powerful representation for graph transformations, code production, optimizations, hardware synthesis, etc.

In Proceedings of the 2nd ACM SIGPLAN Workshop on Intermediate Representations (IR'95), San Francisco, California.Pascal Aubry and Thierry Gautier, IRISA/INRIA, Campus de Beaulieu, F-35042 Rennes Cedex

Télécharger/download (format PDF)

Période:

Antiquité (travaux de doctorat à l'IRISA)