Implementation of the data-flow synchronous language SIGNAL

  • Authors:
  • Pascalin Amagbégnon;Loïc Besnard;Paul Le Guernic

  • Affiliations:
  • IRSA-INRIA, Campus de Beaulieu, 35042 Rennes Cedex, France;IRSA-INRIA, Campus de Beaulieu, 35042 Rennes Cedex, France;IRSA-INRIA, Campus de Beaulieu, 35042 Rennes Cedex, France

  • Venue:
  • PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the techniques used for the compilation of the data-flow, synchronous language SIGNAL. The key feature of the compiler is that it performs formal calculus on systems of boolean equations. The originality of the implementation of the compiler lies in the use of a tree structure to solve the equations.