Abstract
Hoare-style proof systems have been proposed for various language constructs [1]. Nevertheless, it is sometimes questioned as to what extent such systems can help to construct correct programs. One possible answer is provided by observing that efforts to find sound and complete Hoare-style proof systems can be considered as efforts to understand the formal computations of the considered programs. Stated in general terms this observation may seem quite obvious, but it is quite another matter to see what “understanding the formal computations” means for particular classes of programs.
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.
References
Apt, K.R., Ten years of Hoare’s logic, a survey, part I, Fac. Econom., Univ. of Rotterdam (1979); to appear in TOPLAS.
Clarke, E.M., Programming language constructs for which it is impossible to obtain good Hoare axiom systems, J ACM 26 pp 129–147 (1979)
Cook, S.A., Soundness and completeness of an axiomatic system for program verification, SIAM J. Comp. 7, pp. 70–90 (1978).
Damm, W., Fehr, E., A schematological approach to the analysis of the procedure concept in ALGOL-languages, Proc. 5ième Coll. sur les Arbes en Algèbre et en Programmation, Lille, pp. 130–134 (1980).
Gorelick, G.A., A complete axiomatic system for proving assertions about recursive and non-recursive programs, Tech. Rep. 75, Dept. Comp. Sc., Univ. of Toronto (1975).
Kandzia, P., On the “most recent” property of ALGOL-like programs, in: Proc. ICALP 74, Lecture Notes in Computer Science 14, Springer Verlag, pp. 97–111 (1974).
Klein, H.-J., Zur Charakterisierung von Programmen mit endlichen Arten, Diss., Univ. of Kiel, 180 PP. (1980).
Langmaack, H., On correct procedure parameter transmission in higher programming languages, Acta Inform. 2, pp. 110–143 (1973).
Langmaack, H., On procedures as open subroutines I, II, Acta Inform. Acta Inform. 3, pp. 227–241 (1974).
Langmaack, H., On procedures as open subroutines I, II, Acta Inform. Acta Inform. 3, pp. 227–241 (1974).
Langmaack, H., On termination problems for finitely interpreted ALGOL-like programs, Bericht Nr. 7904, Inst. Inform. Prakt. Math.. Univ. of Kiel (1979)
Langmaack, H., Lippe, W. M., Wagner, F., The formal termination problem for programs with finite ALGOL 68-modes, Inform. Proc. Letters 9, pp. 155–159 (1979).
Langmaack, H., Olderog, E.-R., Present-day Hoare-like systems for programming languages with procedures: power, limits and most likely extensions, in: Proc. ICALP 80, Lecture Notes in Computer Science 85, Springer Verlag, pp. 363–373 (1980).
Olderog, E. -R., Sound and complete Hoare-like calculi based on copy rules, Bericht Nr. 7905, Inst. Inform. Prakt. Math., Univ. of Kiel, 57 pp. (1979); to appear in Acta Informatica.
Prawitz, D., Natural deduction — a proof-theoretic study, Almquist & Wiksell, Stockholm, 113 pp. (1965).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Olderog, ER. (1981). Hoare-Style Proof Systems and Formal Computations. In: Brauer, W. (eds) GI — 11. Jahrestagung. Informatik-Fachberichte, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01089-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-01089-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10884-9
Online ISBN: 978-3-662-01089-1
eBook Packages: Springer Book Archive