Abstract
It is a deplorable consequence of the lack of influence of mathematical thinking on the way in which computer programming is currently being pursued, that the regular use of systematic proof procedures, or even the realization that such proof procedures exist, is unknown to the large majority of programmers. Undoubtedly, this fact accounts for at least a large share of the unreliability and the attendant lack of over-all effectiveness of programs as they are used to-day.
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.
Bibliography
McCarthy, J.: 1965, ‘Problems in the Theory of Computation’, Proc. IFIP Congress 65, Vol. 1, pp. 219–222.
McCarthy, J.: 1964, ‘A Formal Description of a Subset of ALGOL’, Proc. of a Conference on Formal Language Description Languages, Vienna.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Naur, P. (1993). Proof of Algorithms by General Snapshots. In: Colburn, T.R., Fetzer, J.H., Rankin, T.L. (eds) Program Verification. Studies in Cognitive Systems, vol 14. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1793-7_3
Download citation
DOI: https://doi.org/10.1007/978-94-011-1793-7_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4789-0
Online ISBN: 978-94-011-1793-7
eBook Packages: Springer Book Archive