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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berry, G., Gonthier, G.: The Esterel synchronous programming language: Design, semantics, implementation. Science of Computer Programming 19, 87–152 (1992)
Boussinot, F., de Simone, R.: The Esterel language. Another Look at Real Time Programming, Proceedings of the IEEE, Special Issue 79, 1293–1304 (1991)
Berry, G.: The constructive semantics of pure Esterel, draft version 3 (1999), http://www-sop.inria.fr/esterel.org/
Closse, E., Poize, M., Pulou, J., Vernier, P., Weil, D.: Saxo-rt: Interpreting Esterel semantic on a sequential execution structure. In: SLAP 2002. Electronic Notes in Theoretical Computer Science, vol. 65. Elsevier, Amsterdam (2002)
Edwards, S.A., Kapadia, V., Halas, M.: Compiling Esterel into static discrete-event code. In: SLAP 2004. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2004)
Berry, G.: Esterel on hardware. Philosophical Transactions of the Royal Society of London, Series A 19(2), 87–152 (1992)
Mignard, F.: Compilation du langage Esterel en systèmes d’équations booléennes. PhD thesis, Ecole des Mines de Paris (1994)
Tardieu, O.: Goto and concurrency: Introducing safe jumps in Esterel. In: SLAP 2004. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2004)
Tardieu, O., de Simone, R.: Curing schizophrenia by program rewriting in Esterel. In: MEMOCODE 2004 (2004)
Tardieu, O.: Loops in Esterel: from operational semantics to formally specified compilers. PhD thesis, Ecole des Mines de Paris (2004)
Schneider, K.: A verified hardware synthesis of Esterel programs. In: DIPES 2000, pp. 205–214 (2001)
Schneider, K., Brandt, J., Schüele, T.: A verified compiler for synchronous programs with local declarations. In: SLAP 2004. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2004)
Malik, S.: Analysis of cyclic combinational circuits. In: ICCAD 1993, pp. 618–625 (1993)
Shiple, T., Berry, G., Touati, H.: Constructive analysis of cyclic circuits. In: Proc. International Design and Testing Conf. (ITDC), Paris (1996)
Namjoshi, K.S., Kurshan, R.P.: Efficient analysis of cyclic definitions. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 394–405. Springer, Heidelberg (1999)
Berry, G.: The semantics of pure Esterel. In: Broy, M. (ed.) Program Design Calculi. Series F: Computer and System Sciences. NATO ASI Series, vol. 118, pp. 361–409 (1993)
Schneider, K., Brandt, J., Schüele, T., Tuerk, T.: Maximal causality analysis. In: ACSD 2005 (2005)
Tardieu, O.: A deterministic logical semantics for Esterel. In: SOS Workshop 2004. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2004)
Tardieu, O., de Simone, R.: Instantaneous termination in pure Esterel. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 91–108. Springer, Heidelberg (2003)
Plotkin, G.: A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University, Denmark (1981)
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)
Park, D.: Concurrency and automata on infinite sequences. In: GI-TCS 1981. LNCS, vol. 104. Springer, Heidelberg (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/11562948_25
Download citation
DOI: https://doi.org/10.1007/11562948_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29209-8
Online ISBN: 978-3-540-31969-6
eBook Packages: Computer ScienceComputer Science (R0)