Abstract
We are finally ready to apply FOL and induction to a real problem: specifying and proving properties of programs. In this chapter, we develop the three foundational methods that underly all verification and program analysis techniques. In the next chapter, we discuss strategies for applying them.
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.
Bibliographic Remarks
D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Technical Report 159, Compaq SRC, December 1998.
E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM, 18(8):453–457, August 1975.
R. W. Floyd. Assigning meanings to programs. In Symposia in Applied Mathematics, volume 19, pages 19–32. American Mathematical Society, 1967.
C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576–580, October 1969.
J. King. A Program Verifier. PhD thesis, Carnegie Mellon University, September 1969.
Z. Manna. Mathematical Theory of Computation. McGraw-Hill, 1974. Also Dover, 2004.
J. McCarthy. Towards a mathematical science of computation. In International Federation for Information Processing, pages 21–28, 1962.
J. McCarthy. A basis for a mathematical theory of computation. Computer Programming and Formal Systems, 1963.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Program Correctness: Mechanics. In: The Calculus of Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74113-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-74113-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74112-1
Online ISBN: 978-3-540-74113-8
eBook Packages: Computer ScienceComputer Science (R0)