This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Referenzen
S. Igarashi, R.L. London, D.C. Luckham, "Automatic program verification", Acta Informatica 4, 2 (1975)
R. Milner, "Implementation and applications of Scott's Logic for Computable Functions", Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7, 1 (1972)
C.A.R. Hoare, N. Wirth, "An axiomatic definition of the programming language PASCAL", Acta Informatica 2, 4 (1973)
L. Aiello, M. Aiello, R. Weyrauch, "The semantics of PASCAL in LCF", Artif. Intell. Memo 221, Stanford Univ. (1974)
E.A. Ashcroft, W.W. Wadge, "LUCID, a formal system for writing and proving programs", SIAM J. Comp. 5, 3 (1976)
E.A. Ashcroft, W.W. Wadge, "LUCID, a non-procedural language with iteration", Comm. ACM, to appear
E.A. Ashcroft, W.W. Wadge, "Program proving without tears", Colloque de l'IRIA sur la construction, l'amélioration et la vérification de programmes, Arc-et-Senans, 1–3 juillet 1975
Z. Manna, "Mathematical theory of computation", McGraw-Hill, 1975
S. Lehmann, J. Loeckx, "An algorithm normalizing elementary while-programs", Bericht Nr. A 76/14, Fachbereich 10, Universität des Saarlandes (Saarbrücken), Dezember 1976
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loeckx, J. (1977). Formale Korrektheitsbeweise für While-Programme. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive