Approximate reachability for dead code elimination in esterel

Authors:
Olivier Tardieu;Stephen A. Edwards
Affiliations:
Department of Computer Science, Columbia University, New York;Department of Computer Science, Columbia University, New York
Venue:
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Year:
2005

Citing 11
Cited 1

The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
Analysis of cyclic combinational circuits

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A Verified Hardware Synthesis of Esterel Programs

DIPES '00 Proceedings of the IFIP WG10.3/WG10.4/WG10.5 International Workshop on Distributed and Parallel Embedded Systems: Architecture and Design of Distributed Embedded Systems
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Efficient Analysis of Cyclic Definitions

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Constructive Analysis of Cyclic Circuits

EDTC '96 Proceedings of the 1996 European conference on Design and Test
Maximal Causality Analysis

ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
A Deterministic Logical Semantics for Esterel

Electronic Notes in Theoretical Computer Science (ENTCS)
Goto and Concurrency Introducing Safe Jumps in Esterel

Electronic Notes in Theoretical Computer Science (ENTCS)
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

Compilation and worst-case reaction time analysis for multithreaded Esterel processing

EURASIP Journal on Embedded Systems - Model-driven high-level programming of embedded systems: selected papers from SLA++P'07 and SLA++P'08

Quantified Score

Hi-index	0.00

Visualization

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.