Refining schizophrenia via graph reachability in esterel

Authors:
Jeong-Han Yun;Chul-Joo Kim;Sunae Seo;Taisook Han;Kwang-Moo Choe
Affiliations:
Division of Computer Science, KAIST, Daejeon, Korea;Division of Computer Science, KAIST, Daejeon, Korea;Samsung Advanced Institute of Technology, Samsung, Yongin, Korea;Division of Computer Science, KAIST, Daejeon, Korea;Division of Computer Science, KAIST, Daejeon, Korea
Venue:
MEMOCODE'09 Proceedings of the 7th IEEE/ACM international conference on Formal Methods and Models for Codesign
Year:
2009

Citing 11
Cited 1

Eliminating false loops caused by sharing in control path

ACM Transactions on Design Automation of Electronic Systems (TODAES)
The foundations of Esterel

Proof, language, and interaction
A new method for compiling schizophrenic synchronous programs

CASES '01 Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Synchronous Programming of Reactive Systems

Synchronous Programming of Reactive Systems
Preemption in Concurrent Systems

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Loops in esterel

ACM Transactions on Embedded Computing Systems (TECS)
A deterministic logical semantics for pure Esterel

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiling Esterel

Compiling Esterel
A Verified Compiler for Synchronous Programs with Local Declarations

Electronic Notes in Theoretical Computer Science (ENTCS)
Instantaneous termination in pure Esterel

SAS'03 Proceedings of the 10th international conference on Static analysis

Detection of harmful schizophrenic statements in esterel

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Esterel is an imperative synchronous language for control-dominant reactive systems. The combination of imperative structures and the perfect synchrony hypothesis often result in schizophrenic statements. Previous studies explain the characteristics of schizophrenia as the instantaneous reentrance to block statements: local signal declarations and parallel statements. In practice, however, most instantly-reentered block statements do not cause any problems in Esterel compilation. In this paper, we refine schizophrenic problems in terms of signal emissions, and suggest an algorithm to detect harmful schizophrenia using reachability on control flow graphs (CFGs) in Esterel. Our algorithm performs well in analyzing practical programs. Moreover, it can be easily applied to existing compilers.