Over-Approximated Control Flow Graph Construction on Pure Esterel

Chul-Joo KIM  Jeong-Han YUN  Seonggun KIM  Kwang-Moo CHOE  Taisook HAN  

IEICE TRANSACTIONS on Information and Systems   Vol.E93-D   No.5   pp.985-993
Publication Date: 2010/05/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E93.D.985
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Formal Approach)
Category: Program Analysis
esterel,  control flow graph,  synchronous language,  

Full Text: PDF(979.9KB)>>
Buy this Article

Esterel is an imperative synchronous language for control-dominant reactive systems. Regardless of imperative features of Esterel, combination of parallel execution and preemption makes it difficult to build control flow graphs (CFGs) of Esterel programs. Simple and convenient CFGs can help to analyze Esterel programs. However, previous researches are not suitable for flow analyses of imperative languages. In this work, we present a method to construct over-approximated CFGs for Pure Esterel. Generated CFGs expose invisible interferences among threads and show program structures explicitly so that they are useful for program analyses based on graph theory or control-/data- flows.