Summary
A notation for total correctness of a program with respect to input and output formulas is introduced; and Hoare's loop axiom is rearranged in such a way as to form a good inference system for the total correctness. Its consistency and completeness are shown.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dijkstra, E.W.: A discipline of programming. Enlewood Cliffs, N.J.: Prentice-Hall 1976
Hoare, C.A.R.: An axiomatic basis for the computer programming. Comm. ACM 12, 576–580(1969)
Hoare, C.A.R., Lauer, P.E.: Consistent and complementary formal theories of the semantics of programming languages. Acta Informat. 3, 135–153 (1974)
Katz, S., Manna, Z.: A closer look at termination. Acta Informat. 5, 333–352 (1975)
Manna, Z., Pnueli, A.: Axiomatic approach to total correctness. Acta Informat. 3, 243–264 (1974)
Wang, A.: An axiomatic basis for proving total correctness of GOTO-Programs. Nordisk Tidskr. Informationsbehandling (BIT), 88–102 (1976)
Sokolowski, S.: Total correctness for procedures. Mathematical Foundations of Computer Science 1977, Lecture Notes in Computer Science (J. Gruska, ed.), Vol. 53, pp. 475–483, 1977
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sokolowski, S. Axioms for total correctness. Acta Informatica 9, 61–71 (1977). https://doi.org/10.1007/BF00263765
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00263765