Published June 24, 2003
| Version v1
Conference paper
Optimizations for faster execution of Esterel programs
Creators
Contributors
Others:
- Centre de Mathématiques Appliquées (CMA) ; Mines Paris - PSL (École nationale supérieure des mines de Paris) ; Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)
- Theory and Practice of Synchronous Reactive Systems (TICK) ; Centre Inria d'Université Côte d'Azur (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Mines Paris - PSL (École nationale supérieure des mines de Paris) ; Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)
Description
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation of the reactive features of the language, these techniques need now to be accommodated with traditional issues of Esterel - the definition of formal semantics, the constructive causality, and the design of efficient and correct methods for analysis and optimization. We address some of these problems by defining a new intermediate model for the representation of Esterel programs. The new representation level preserves much of the initial program structure while making the control flow pattern and the hierarchical state structure explicit. It supports the full Esterel semantics, and it is a good support for efficient analysis, optimization, and code generation algorithms based on static analysis.
Abstract
International audienceAdditional details
Identifiers
- URL
- https://minesparis-psl.hal.science/hal-00618104
- URN
- urn:oai:HAL:hal-00618104v1
Origin repository
- Origin repository
- UNICA