Automated Technology for Verification and Analysis

Volume 3707 of the series Lecture Notes in Computer Science pp 323-337

Approximate Reachability for Dead Code Elimination in Esterel ⋆ 

  • Olivier TardieuAffiliated withDepartment of Computer Science, Columbia University
  • , Stephen A. EdwardsAffiliated withDepartment of Computer Science, Columbia University

* Final gross prices may vary according to local VAT.

Get Access


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.