Advertisement

Logic of Programs 1983: Logics of Programs pp 383-395 | Cite as

Hoare's logic for programs with procedures — What has been achieved?

  • Ernst-Rüdiger Olderog
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)

Keywords

Structure Tree Proof System Procedure Call Acta Inform Procedure Parameter 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ap 1]
    Apt, K.R., A sound and complete Hoare-like system for a fragment of Pascal, Report 1W 96/78, Mathematisch Centrum, Amsterdam, 1978.Google Scholar
  2. [Ap 2]
    Apt, K.R., Ten years of Hoare's logic, a survey-part I, ACM TOPLAS 3 (1981) 431–483.Google Scholar
  3. [dB]
    de Bakker, J.W., Mathematical theory of program correctness (Prentice Hall International, London, 1980).Google Scholar
  4. [BKM]
    de Bakker, J.W., Klop, J.W., Meyer, J.-J.Ch., Correctness of programs with function procedures, in: [Ko] 94–112.Google Scholar
  5. [C1]
    Clarke, E.M., Programming language constructs for which it is impossible to obtain good Hoare-like axioms, J. ACM 26 (1979) 129–147.Google Scholar
  6. [CGH]
    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).Google Scholar
  7. [Co]
    Cook, S.A., Soundness and completeness of an axiom system for program verification, SIAM J. Comput. 7 (1978) 70–90.Google Scholar
  8. [CN]
    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.Google Scholar
  9. [Da]
    Damm, W., The 10-and 01-hierarchies, Theoret. Comput. Sci. 20 (1982) 95–207.Google Scholar
  10. [DJ]
    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.).Google Scholar
  11. [Di]
    Dijkstra, E.W., Recursive programming, Numer. Math. 2 (1960) 312–318.Google Scholar
  12. [ENO]
    Ernst, G.W., Navlakha, J.K., Ogden, W.F., Verification of programs with procedure type parameters, Acta Inform. 18 (1982) 149–169.Google Scholar
  13. [GCH]
    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).Google Scholar
  14. [Go]
    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).Google Scholar
  15. [GHL]
    Grau, A.A., Hill, U., Langmaack, H., Translation of ALGOL 60. Handbook for automatic computation, Vol. 1b (Springer, Berlin-Heidelberg-New York, 1967).Google Scholar
  16. [Ha]
    Harel, D., First-order dynamic logic, Lecture Notes in Computer Science 68 (1979).Google Scholar
  17. [Ho 1]
    Hoare, C.A.R., An axiomatic basis for computer programming, Comm. ACM 12 (1969) 576–580, 583.Google Scholar
  18. [Ho 2]
    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.Google Scholar
  19. [JW]
    Jensen, K., Wirth, N., Pascal user manual and report (Springer, Berlin, 1975).Google Scholar
  20. [Jo]
    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).Google Scholar
  21. [Ko]
    Kozen, D., Ed., Proc. Logics of Programs 1981, Lecture Notes in Computer Science 131 (1982).Google Scholar
  22. [La 1]
    Langmaack, H., On correct procedure parameter transmissions in higher programming languages, Acta Inform. 2 (1973) 110–142.Google Scholar
  23. [La 2]
    Langmaack, H., On procedures as open subroutines, Acta Inform. 2 (1973) 311–333, and Acta Inform. 3 (1974) 227–241.Google Scholar
  24. [La 3]
    Langmaack, H., On termination problems for finitely interpreted ALGOL-like programs, Acta Inform. 18 (1892) 79–108.Google Scholar
  25. [La 4]
    Langmaack, H., Aspects of programs with finite modes, in: Proc. Foundations of Computation Theory, Sweden, 1983 (to appear in Lecture Notes of Computer Science).Google Scholar
  26. [LO]
    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.Google Scholar
  27. [Ol 1]
    Olderog, E.-R., Sound and complete Hoare-like calculi based on copy rules, Acta Inform. 16 (1981) 161–197.Google Scholar
  28. [Ol 2]
    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.).Google Scholar
  29. [Ol 3]
    Olderog, E.-R., Charakterisierung Hoarescher Systeme für Algol-ähnliche Programmiersprachen, Dissertation, Univ. Kiel (1981).Google Scholar
  30. [Ol 4]
    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.Google Scholar
  31. [RR]
    Randell, B., Russell, L.J., ALGOL 60 implementation (Academic Press, London, 1964).Google Scholar
  32. [Pr]
    Prawitz, D., Natural deduction — a proof-theoretic study (Almqvist and Wiksell, Stockholm, 1965).Google Scholar
  33. [THM]
    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).Google Scholar
  34. [Wi]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Ernst-Rüdiger Olderog
    • 1
    • 2
  1. 1.Institut für InformatikUniversität KielGermany
  2. 2.Programming Research GroupOxford UniversityUK

Personalised recommendations