Approximate Reachability for Dead Code Elimination in Esterel ⋆
- Cite this paper as:
- Tardieu O., Edwards S.A. (2005) Approximate Reachability for Dead Code Elimination in Esterel ⋆ . In: Peled D.A., Tsay YK. (eds) Automated Technology for Verification and Analysis. ATVA 2005. Lecture Notes in Computer Science, vol 3707. Springer, Berlin, Heidelberg
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel ⋆ extends Esterel with a non-instantaneous jump instruction (compatible with concurrency, preemption, etc.) so as to enable powerful source-to-source program transformations, amenable to formal verification. In this work, we propose an approximate reachability algorithm for Esterel ⋆ and use its output to remove dead code. We prove the correctness of our techniques.
Unable to display preview. Download preview PDF.