This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W. "A Discipline of Programming" Prentice-Hall 1976
Dijkstra, E.W. "Guarded Commands, Nondeterminacy and Formal Derivation of Programs" Comm. ACM 18 (1975) 453–457
Hoare, C.A.R. "Axiomatic Basis for Computer Programming" Comm. ACM 12 (1969) 576–580
Hoare, C.A.R. "Procedures and Parameters: An Axiomatic Approach" Lecture Notes in Mathematics 188 (1971), Symposium on Semantics of Algorithmic Languages (ed. E.Engeler) 62–70
Hoare, C.A.R.; Lauer, P. "Consistent and Complementary Formal Theories of the Semantics of Programming Languages" Acta Informatica 3 (1974) 135–153
Manna, Z. "Mathematical Theory of Computation" McGraw Hill 1974
de Roever, W.P. "Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination" Lecture Notes in Computer Science 45 (1976), Mathematical Foundations of Computer Science (ed. A.Mazurkiewicz) 472–481
Salwicki, A. "Formalised Algorithmic Languages" Bull.Acad. Polon.Sci., Serie Math.Astr.Phys., 18 (1970) 227–232
Scott, D. "Outline of a Mathematical Theory of Computation" Oxford University, Programming Research Group, Technical Monograph PRG-2, 1970
Sokołowski, S. "Axioms for Total Correctness" to appear in Acta Informatica
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sokołowski, S. (1977). Total correctness for procedures. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_170
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_170
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive