Instantaneous Termination in Pure Esterel

  • Olivier Tardieu
  • Robert de Simone
Conference paper

DOI: 10.1007/3-540-44898-5_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2694)
Cite this paper as:
Tardieu O., de Simone R. (2003) Instantaneous Termination in Pure Esterel. In: Cousot R. (eds) Static Analysis. SAS 2003. Lecture Notes in Computer Science, vol 2694. Springer, Berlin, Heidelberg

Abstract

Esterel is a design language for the representation of embedded systems. Based on the synchronous reactive paradigm, its execution relies on a clear distinction of instants of computation. As a consequence, deciding whether a piece of a program may or may not run instantaneously is central to any compilation scheme, both for correctness and efficiency. In general, this information can be obtained by an exhaustive exploration of all possible execution paths, which is expensive. Most compilers approximate it through algorithmic methods amenable to static analysis. In our contribution, we first formalize the analysis involved in detecting statements that may run instantaneously. Then, we identify statements that may terminate and be instantaneously reentered. This allows us to model precisely these compilers front-end activities with a clear mathematical specification and led us to uncover inefficiencies in the Esterel v5 academic compiler from Ecole des Mines and INRIA.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Olivier Tardieu
    • 1
  • Robert de Simone
    • 1
  1. 1.INRIASophia AntipolisFrance

Personalised recommendations