Abstract
This chapter has two objectives. First, the basic mathematical concepts and notation used throughout this book are introduced. Secondly, the principle of induction, the indispensable tool in program verification, is presented in two guises and discussed in some detail.
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.
Bibliographical Remarks
Brainerd, W. S. and Landweber, L. H.: Theory of Computation, John Wiley, 1974.
Cutland, N.: Computability: An Introduction to Recursive Function Theory, Cambridge University Press, Cambridge, 1980.
Loeckx, J.: AlgorithmentheorieSpringer-Verlag, 1976.
Enderton, H. B.: A Mathematical Introduction to Logic, Academic Press, 1972.
Aubin, R.: Mechanizing structural induction (Part I), Theor. Comp. Sc., 9, pp. 329–345, 1979.
Wand, M.: Induction, Recursion and Programming, North-Holland, 1980.
Cohn, P. M.: Universal Algebra, Harper and Row, 1965.
Burstall, R. M.: Proving properties of programs by structural induction, Comp. J., 12, pp. 41–48, 1969.
Manna Z.: Mathematical Theory of ComputationMcGraw-Hill, 1974.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Loeckx, J., Sieber, K. (1987). Mathematical Preliminaries. In: The Foundations of Program Verification. Series in Computer Science. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-96753-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-322-96753-4_1
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-322-96754-1
Online ISBN: 978-3-322-96753-4
eBook Packages: Springer Book Archive