Over-Approximated Control Flow Graph Construction on Pure Esterel
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.5 pp.985-993
- Publication Date
- 2010/05/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E93.D.985
- Type of Manuscript
- Special Section PAPER (Special Section on Formal Approach)
- Category
- Program Analysis
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Chul-Joo KIM, Jeong-Han YUN, Seonggun KIM, Kwang-Moo CHOE, Taisook HAN, "Over-Approximated Control Flow Graph Construction on Pure Esterel" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 5, pp. 985-993, May 2010, doi: 10.1587/transinf.E93.D.985.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.985/_p
Copy
@ARTICLE{e93-d_5_985,
author={Chul-Joo KIM, Jeong-Han YUN, Seonggun KIM, Kwang-Moo CHOE, Taisook HAN, },
journal={IEICE TRANSACTIONS on Information},
title={Over-Approximated Control Flow Graph Construction on Pure Esterel},
year={2010},
volume={E93-D},
number={5},
pages={985-993},
abstract={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.},
keywords={},
doi={10.1587/transinf.E93.D.985},
ISSN={1745-1361},
month={May},}
Copy
TY - JOUR
TI - Over-Approximated Control Flow Graph Construction on Pure Esterel
T2 - IEICE TRANSACTIONS on Information
SP - 985
EP - 993
AU - Chul-Joo KIM
AU - Jeong-Han YUN
AU - Seonggun KIM
AU - Kwang-Moo CHOE
AU - Taisook HAN
PY - 2010
DO - 10.1587/transinf.E93.D.985
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2010
AB - 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.
ER -
English
