This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
HOARE, C.A.R., An axiomatic basis for computer programming, CACM 12, Oct. 1969, pp. 576–580, 583.
FLOYD, R.W., Assigning meaning to programs, in Proc. of a Symp. in Appl. Math., Vol. 19, J.T.Schwartz (ed.), AMS, Providence Island, 1967, pp. 19–32.
MANNA, Z., Mathematical Theory of Computation, McGraw-Hill, New York, 1974.
ELSPAS, B., The semi-automatic generation of inductive assertions for program correctness proofs, GMD-Bericht Nr.55, St.Augustin (W. Germany), 1972.
WEGBREIT, B., The synthesis of loop predicates, CACM 17, No. 2, Feb. 1974, pp. 102–112.
MANNA, Z. and PNUELI, A., Axiomatic approach to total correctness of programs, Acta informatica 3, 1974, pp. 243–263.
COY, W., Inductive assertions in subrecursive programming languages, Information Proc. Letters, Vol. 4, No. 5, 1976, pp. 121–126.
DAHL, O.-J., DIJKSTRA, E.W., and HOARE, C.A.R., Structered programming, Academic Press, London, 1972.
KLEENE, S.C., Introduction to metamathematics, North Holland Publ., Amsterdam, 1971.
GÖDEL, K., Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme 1, Monatshefte für Mathematik und Physik 38, 1931, pp. 173–198.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coy, W. (1976). A note on the automatic generation of inductive assertions. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_181
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive