Approximate Reachability for Dead Code Elimination in Esterel ⋆ 

  • Olivier Tardieu
  • Stephen A. Edwards
Conference paper

DOI: 10.1007/11562948_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3707)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Olivier Tardieu
    • 1
  • Stephen A. Edwards
    • 1
  1. 1.Department of Computer ScienceColumbia UniversityNew York

Personalised recommendations