Browse > Article

Syntax-driven Automata Generation for Esterel  

Lee, Chul-Woo (KAIST 전산학과)
Kim, Chul-Joo (삼성전자 DMC 연구소)
Yun, Jeong-Han (KAIST 전산학과)
Han, Tai-Sook (KAIST 전산학과)
Choe, Kwang-Moo (KAIST 전산학과)
Abstract
Esterel is an imperative synchronous language and its formal semantic based on finite state machine makes it easy to perform program analyses using automata. In this paper, we propose a syntax-driven automata generation rule. Because our rule intuitively expresses syntactic structure, it is very useful for other program analyses.
Keywords
Esterel; Automata;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 S. Tini, "An axiomatic semantics for Esterel," Theoretical Computer Science, 2001.
2 GD Plotkin, "A Structural Approach to Operational Semantics," Lectures Notes, Aarhus University, Aarhus, Denmark, 1981.
3 김철주, 윤정한, 서선애, 최광무, 한태숙, "Esterel에서 근사-제어흐름그래프의 효율적인 생성," 정보과학회논문지 : 컴퓨팅의 실제 및 레터, 제15권 제11호, pp.801-880, 2009.   과학기술학회마을
4 G. Berry, "The Constructive Semantics of Pure ESTEREL," Draft book available at http://www.inria.fr/meije/esterel/esterel-eng.html, 1999.
5 A. Bouali, "XEVE, an ESTEREL Verification Environment," In Proceedings of International Conference on Computer Aided Verification, vol.1427, pp.500-504, 1998.
6 "Esterel Compiler version 5.21," http://www.inria.fr/meije/esterel/esterel-eng.html.
7 D. Potop-Butucaru, S. A. Edwards, and G. Berry, "Compiling ESTEREL," Springer, 2007.
8 "CEC: The Columbia Esterel Compiler," http://www.cs.columbia.edu/~sedwards/cec/.