Abstract
We present a formalization of the first 100 pages of Winskel's The Formal Semantics of Programming Languages in the theorem prover Isabelle/HOL: 2 operational, 2 denotational, 1 axiomatic semantics, a verification condition generator, and the necessary soundness, completeness and equivalence proofs, all for a simple imperative language.
Research supported by DFG Schwerpunktprogramm Deduktion.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Y. Bertot and R. Fraer. Reasoning with executable specifications. In TAPSOFT '95: Theory and Practice of Software Development, volume 915 of Lect. Notes in Comp. Sci., pages 531–545. Springer-Verlag, 1995.
M. Gordon. Programming Language Theory and its Implementation. Prentice-Hall, 1988.
M. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwistle and P. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving. Springer-Verlag, 1989.
M. Gordon and T. Melham. Introduction to HOL: a theorem-proving environment for higher-order logic. Cambridge University Press, 1993.
P. V. Homeier and D. F. Martin. Trustworthy tools for trustworthy programs: A verified verification condition generator. In T. Melham and J. Camilleri, editors, Higher Order Logic Theorem Proving and its Applications, volume 859 of Lect. Notes in Comp. Sci., pages 269–284. Springer-Verlag, 1994.
H. Lötzbeyer and R. Sandner. Proof of the equivalence of the operational and denotational semantics of IMP in Isabelle/ZF. Project report, Institut für Informatik, TU München, 1994.
L. C. Paulson. Logic and Computation. Cambridge University Press, 1987.
L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lect. Notes in Comp. Sci. Springer-Verlag, 1994.
L. C. Paulson. Generic automatic proof tools. Technical Report 396, University of Cambridge, Computer Laboratory, 1996.
F. Regensburger. HOLCF: Eine konservative Erweiterung von HOL um LCF. PhD thesis, Technische UniversitÄt München, 1994.
F. Regensburger. HOLCF: Higher Order Logic of Computable Functions. In E. Schubert, P. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and its Applications, volume 971 of Lect. Notes in Comp. Sci., pages 293–307. Springer-Verlag, 1995.
L. van Benthem Jutting. Checking Landau's “Grundlagen” in the AUTOMATH System. PhD thesis, Eindhoven University of Technology, 1977.
G. Winskel. The Formal Semantics of Programming Languages. MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nipkow, T. (1996). Winskel is (almost) right. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_48
Download citation
DOI: https://doi.org/10.1007/3-540-62034-6_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62034-1
Online ISBN: 978-3-540-49631-1
eBook Packages: Springer Book Archive