Loading...
Please wait, while we are loading the content...
Similar Documents
Approximate Reachability for Dead Code Elimination in Esterel ⋆
| Content Provider | CiteSeerX |
|---|---|
| Author | Tardieu, Olivier Edwards, Stephen A. |
| Abstract | Abstract. Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel ⋆ extends Esterel with a noninstantaneous 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. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Dead Code Dead Code Elimination Noninstantaneous Jump Instruction Approximate Reachability Imperative Synchronous Programming Language Approximate Reachability Algorithm Powerful Source-to-source Program Transformation |
| Content Type | Text |
| Resource Type | Article |