Abstract
We prove the correctness of the translation of a prototypic While-language with nested, parameterless procedures to an abstract assembler language with finite stacks. A variant of the well-known wp and wlp predicate transformers, the weakest relative precondition transformer wrp, together with a symbolic approach for describing semantics of assembler code allows us to explore assembler programs in a manageable way and to ban finiteness from the scene early.
The work of the second author is supported by DFG grant La 426/15-2.
Chapter PDF
Similar content being viewed by others
References
E. Börger and I. Durdanović. Correctness of compiling Occam to transputer code. The Computer Journal, 39(1), 1996.
L. M. Chirica and D. F. Martin. Towards compiler implementation correctness proofs. ACM TOPLAS, 8(2):185–214, April 1986.
E. W. Dijkstra and C. S. Scholten. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, 1990.
J. D. Guttman, J. D. Ramsdell, and M. Wand. VLISP: A verified implementation of Scheme. Lisp and Symbolic Computation, 8:5–32, 1995.
C. A. R. Hoare, I. J. Hayes, H. Jifeng, C. C. Morgan, A. W. Roscoe, J. W. Sanders, I. H. Sorenson, J. M. Spivey, and B. A. Sufrin. Laws of programming. Communications of the ACM, 30(8):672–687, August 1987.
C. A. R. Hoare, H. Jifeng, and A. Sampaio. Normal form approach to compiler design. Acta Informatica, 30:701–739, 1993.
H. Langmaack. Software engineering for certification of systems: specification, implementation, and compiler correctness (in German). Informationstechnik und Technische Informatik, 39(3):41–47, 1997.
J. S. Moore. Piton, A Mechanically Verified Assembly-Level Language. Kluwer Academic Publishers, 1996.
M. Müller-Olm. Modular Compiler Verfication: A Refinement-Algebraic Approach Advocating Stepwise Abstraction, LNCS 1283. Springer-Verlag, 1997.
M. Müller-Olm and A. Wolf. On excusable and inexcusable failures: towards an adequate notion of translation correctness. In FM’ 99, LNCS 1709, pp. 1107–1127. Springer-Verlag, 1999.
H. R. Nielson and F. Nielson. Semantics with Applications: A Formal Introduction. Wiley, 1992.
T. S. Norvell. Machine code programs are predicates too. In 6th Refinement Workshop, Workshops in Computing. Springer-Verlag and British Computer Society, 1994.
E. Pofahl. Methods used for inspecting safety relevant software. In High Integrity Programmable Electronics, pages 13–14. Dagstuhl-Sem.-Rep. 107, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller-Olm, M., Wolf, A. (2000). On the Translation of Procedures to Finite Machines. In: Smolka, G. (eds) Programming Languages and Systems. ESOP 2000. Lecture Notes in Computer Science, vol 1782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46425-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-46425-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67262-3
Online ISBN: 978-3-540-46425-9
eBook Packages: Springer Book Archive