Over-Approximated Control Flow Graph Construction on Pure Esterel

Kim, Chul-Joo; Yun, Jeong-Han; Kim, Seonggun; Choe, Kwang-Moo; Han, Tian

doi:10.1587/transinf.e93.d.985

Cited by 1 publication

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…of loops" indicates the number of loop statements. 13 The column labeled "CFG" indicates the time to generate the CFGs [Kim et al 2010]. The column labeled "Detection" indicates the analysis time to find four types of harmful schizophrenic statements.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Detection of harmful schizophrenic statements in esterel

Yun

Kim

et al. 2013

ACM Trans. Embed. Comput. Syst.

Self Cite

View full text Add to dashboard Cite

In imperative synchronous languages, a statement is called schizophrenic if it is executed more than once in a single clock. When a schizophrenic statement is translated into a circuit, the circuit can behave abnormally because of the multiple executions. To solve the problems caused by schizophrenic statements, compilers duplicate the statements to avoid multiple executions. Esterel is an imperative synchronous language. Schizophrenic statements in Esterel are considered to occur due to the instantaneous reentrance of local signal declarations or parallel statements. However, if the corresponding circuit of a schizophrenic statement behaves normally, it is harmless and thus curing is not necessary. In this paper, we identify the conditions under which a schizophrenic statement of the Esterel program must be cured during circuit translation. We also propose an algorithm to detect schizophrenic statements that have to be cured on the control flow graphs (CFGs) of source codes. Our algorithm detects all schizophrenic statements that have to be cured and results in fewer false alarms on the benchmark programs used in the previous work. It is simple and based on the CFG of a program, implying that it can be merged into existing compilers easily.

show abstract

Section: Methodsmentioning

confidence: 99%

“…We have proposed a formal method to construct control flow graphs (CFGs) of Esterel programs [Kim et al 2010]. Figure 16 depicts CFG representations of Esterel statements.…”

Section: Control Flow Graphs Of Esterelmentioning

confidence: 99%