Author's address from Oct. 1983: Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Olshausenstr. 40 - 60, D-2300 Kiel 1
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R., A sound and complete Hoare-like system for a fragment of Pascal, Report 1W 96/78, Mathematisch Centrum, Amsterdam, 1978.
Apt, K.R., Ten years of Hoare's logic, a survey-part I, ACM TOPLAS 3 (1981) 431–483.
de Bakker, J.W., Mathematical theory of program correctness (Prentice Hall International, London, 1980).
de Bakker, J.W., Klop, J.W., Meyer, J.-J.Ch., Correctness of programs with function procedures, in: [Ko] 94–112.
Clarke, E.M., Programming language constructs for which it is impossible to obtain good Hoare-like axioms, J. ACM 26 (1979) 129–147.
Clarke, E.M., German, S.M., Halpern, J.Y., On effective axiomatizations of Hoare logics, Tech. Report TR-14-82, Aiken Computation Laboratory, Harvard Univ., 1982 (to appear in J.ACM).
Cook, S.A., Soundness and completeness of an axiom system for program verification, SIAM J. Comput. 7 (1978) 70–90.
Cousineau, G., Nivat, M., On rational expressions representing infinite rational trees: application to the structure of flowcharts, in: J. Becvar, Ed., Proc. 8th Math. Found. of Comput. Sci., Lecture Notes in Computer Science 74 (1979) 567–580.
Damm, W., The 10-and 01-hierarchies, Theoret. Comput. Sci. 20 (1982) 95–207.
Damm, W., Josko, B., A sound and relatively* complete Hoare-logic for a language with higher type procedures, Schriften zur Informatik und Angew. Math. Nr. 77, RWTH Aachen, 1982 (to appear in Acta Inform.).
Dijkstra, E.W., Recursive programming, Numer. Math. 2 (1960) 312–318.
Ernst, G.W., Navlakha, J.K., Ogden, W.F., Verification of programs with procedure type parameters, Acta Inform. 18 (1982) 149–169.
German, S.M., Clarke, E.M., Halpern, J.Y., A stronger axiom system for reasoning about procedures as parameters, in: E.M. Clarke, D. Kozen, Eds., Proc. Logics of Programs 1983 (to appear in Lecture Notes in Computer Science).
Gorelick, G.A., A complete axiomatic system for proving assertions about recursive and non-recursive programs, Tech. Report 75, Dept. of Comput. Sci., Univ. of Toronto (1975).
Grau, A.A., Hill, U., Langmaack, H., Translation of ALGOL 60. Handbook for automatic computation, Vol. 1b (Springer, Berlin-Heidelberg-New York, 1967).
Harel, D., First-order dynamic logic, Lecture Notes in Computer Science 68 (1979).
Hoare, C.A.R., An axiomatic basis for computer programming, Comm. ACM 12 (1969) 576–580, 583.
Hoare, C.A.R., Procedures and parameters: an axiomatic approach, in: E. Engeler, Ed., Symposium on semantics of algorithmic languages, Lecture Notes in Mathematics 188 (Springer, Berlin, 1971) 102–116.
Jensen, K., Wirth, N., Pascal user manual and report (Springer, Berlin, 1975).
Josko, B., On expressive interpretations of a Hoare-logic for a language with higher type procedures, Schriften zur Informatik und Angew. Math., RWTH Aachen (1983).
Kozen, D., Ed., Proc. Logics of Programs 1981, Lecture Notes in Computer Science 131 (1982).
Langmaack, H., On correct procedure parameter transmissions in higher programming languages, Acta Inform. 2 (1973) 110–142.
Langmaack, H., On procedures as open subroutines, Acta Inform. 2 (1973) 311–333, and Acta Inform. 3 (1974) 227–241.
Langmaack, H., On termination problems for finitely interpreted ALGOL-like programs, Acta Inform. 18 (1892) 79–108.
Langmaack, H., Aspects of programs with finite modes, in: Proc. Foundations of Computation Theory, Sweden, 1983 (to appear in Lecture Notes of Computer Science).
Langmaack, H., Olderog, E.-R., Present-day Hoare-like systems for programming languages with procedures: power, limits and most likely extensions, in: J.W. de Bakker, J. van Leeuwen, Eds., Proc. 7th Coll. Automata, Languages and Programming, Lecture Notes in Computer Science 85 (1980) 363–373.
Olderog, E.-R., Sound and complete Hoare-like calculi based on copy rules, Acta Inform. 16 (1981) 161–197.
Olderog, E.-R., Correctness of programs with Pascal-like procedures without global variables, revised version of Bericht Nr. 8110, Institut für Informatik und Prakt. Math., Univ. Kiel, 1981 (to appear in Theoret. Comput. Sci.).
Olderog, E.-R., Charakterisierung Hoarescher Systeme für Algol-ähnliche Programmiersprachen, Dissertation, Univ. Kiel (1981).
Olderog, E.-R., A characterization of Hoare's logic for programs with Pascal-like procedures, in: Proc 15th ACM Symp. on Theory of Computing (Boston, Mass., 1983) 320–329.
Randell, B., Russell, L.J., ALGOL 60 implementation (Academic Press, London, 1964).
Prawitz, D., Natural deduction — a proof-theoretic study (Almqvist and Wiksell, Stockholm, 1965).
Trakhtenbrot, B.A., Halpern, J.Y., Meyer, A.R., Denotational semantics and partial correctness for an Algol-like language with procedure parameters and sharing, Tech. Report, Laboratory for Computer Science, MIT (1982).
Winklmann, K., On the complexity of some problems concerning the use of procedures, Acta Inform. 18 (1982) 299–318, and Acta Inform. 18 (1983) 411–430.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olderog, ER. (1984). Hoare's logic for programs with procedures — What has been achieved?. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_375
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_375
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive