2002
DOI: 10.1016/s1571-0661(05)80442-6
|View full text |Cite
|
Sign up to set email alerts
|

ESUIF: An Open Esterel Compiler

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2004
2004
2009
2009

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 11 publications
(12 reference statements)
0
5
0
Order By: Relevance
“…For Esterel, the STCFG is obtained from a yacc grammar given in [5] using a syntax directed scheme. Each STCFG node contains a pointer to the AST representation of the corresponding statement.…”
Section: Implementation and Resultsmentioning
confidence: 99%
“…For Esterel, the STCFG is obtained from a yacc grammar given in [5] using a syntax directed scheme. Each STCFG node contains a pointer to the AST representation of the corresponding statement.…”
Section: Implementation and Resultsmentioning
confidence: 99%
“…Hence, an event driven simulation scheme can be used to generate code, which is compiled into efficient C code. A fourth approach is based on the translation of programs into concurrent control data flow graphs [12], [18], [10], [11], [24], whose sizes depend linearly on the given program. At each instant, the control flow graph is traversed until active nodes are found to trigger the execution of the corresponding subtree.…”
Section: Introductionmentioning
confidence: 99%
“…The control reenters the program after one clock tick and execution is resumed from the point after the pause statement. This flow of control, as given in [7], is illustrated in Figure 1. In this figure, the program is given on the left hand side and the flow of control is depicted on the right hand side.…”
Section: Pause and Time Dependencymentioning
confidence: 99%
“…Pause-handlers and arbiters are part of the execution environment and are standard run-time supports used in the implementation of Esterel programs [7]. We abstract out these in our control flow representation by modelling pause statement as a predicate with two outgoing edges: a true edge which goes to its lexical successor, and a false edge which goes to the end of module node.…”
Section: Pause and Time Dependencymentioning
confidence: 99%