Zusammenfassung
Es gibt für realistische Programmiersprachen kein end-liches Axiomensystem, das es gestattet die einschlägigen Theoreme einer Theorie der Programmiersprache abzuleiten. Die Transportabilität von Programmen kann durch Korrektheitsbeweise im Rahmen einer axiomatischen Theorie nicht vollständig gesichert werden.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Literatur
Floyd, R.W. (1967) "Assigning Meanings to Programs” in Proz.Sym. in Applied Math. 19, Mathematical Aspects of Computer Science (Schartz, J.T. ed), Amer.Math.Soc. pp. 19–32
Hoare, C.A.R. (1969) "An Axiomatic Basis for Computer Programming". Comm. ACM 12, pp. 576–583
Hoare, C.A.R. and Wirth, N. (1973) "An axiomatic Definition of the Programming Language". Pascal Acta Information Vol 2, pp. 335–357
Hotz, G. (1972) "Grundlagen einer Theorie der Programmiersprachen II". Berichte des Fachbereiches für Angew. Math. + Informatik, pp. 1–51
Manna, Z. and Paueli, A. (1974) " Axiomatic Approach to total Correctures of Programs", Acta Informatica Vol.3, pp. 243–265
Lucas, P. and Walk, K. (1969) "On the Formal Description of PL/I", Annual Review in Automatic Programming, Vol. 6, Part 3, Pergamon Press
Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics, Vol. 188, Springer-Verlag 1971 (ed E. Engler).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hotz, G. (1975). Axiomatisierung von Programmiersprachen und ihre Grenzen. In: Hackl, C.E. (eds) Programming Methodology. IBM 1974. Lecture Notes in Computer Science, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07131-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-07131-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07131-0
Online ISBN: 978-3-540-37401-5
eBook Packages: Springer Book Archive