Preview
Unable to display preview. Download preview PDF.
References
E.A. Ashcroft, W.W. Wadge, "LUCID, a formal system for writing and proving programs", SIAM Journal Comp. 5, 3 (1976)
E.W. Dijkstra, "A discipline of programming", Prentice Hall, 1976
I. Glasner, "Formale Beweise über while-Programme: Ein Kalkül und sein Modell", Diplomarbeit, Universität des Saarlandes, Saarbrücken, 1978
C.A.R. Hoare, "An axiomatic basis of computer programming", Comm. ACM 12, 10 (1969)
S. Lehmann, J. Loeckx, "An algorithm normalizing elementary while-programs", Bericht A 76/14, Fachbereich 10, Universität des Saarlandes, Saarbrücken (1976).
Z. Manna, "Mathematical theory of computation", McGraw-Hill, 1974
Z. Manna, A. Pnueli, "Axiomatic approach to total correctness of programs", Acta Informatica 3, 3 (1974)
R. Milner, "Implementation and application of Scott's logic for computable functions", SIGPLAN Notices 7,1 (1972)
J.H. Morris, B. Wegbreit, "Subgoal induction", Comm. ACM 20, 4 (1977).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glasner, I., Loeckx, J. (1979). A calculus for proving properties of while-programs. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_30
Download citation
DOI: https://doi.org/10.1007/3-540-09541-1_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09541-5
Online ISBN: 978-3-540-35010-1
eBook Packages: Springer Book Archive