Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions

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


This paper indicates that presently known Hoare-like systems for ALGOL-like languages with static scope semantics can deal only with programs which can effectively be transformed into formally equivalent programs without procedure nesting (Remark 4 and 5 and Section 8). There are not yet methods to attack PASCAL-like programs (sample program \(\tilde \pi\) in section 9), programs without self-application of procedures (Conjecture 1) and program classes for which the formal termination problem is solvable (Conjecture 2).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ap 78]
    Apt, K.R.: A sound and complete Hoare-like system for a fragment of PASCAL, Math. Centrum IW 96/78, Amsterdam, 59 pp. (1978)Google Scholar
  2. [Ap 79]
    Apt, K.R.: Ten years of Hoare's logic, a survey, Fac.Econom., Erasmus Univ. Rotterdam, 43 pp. (1979)Google Scholar
  3. [CO 78]
    Cartwright, R., Oppen, D.: Unrestricted procedure calls in Hoare's logic, in: Proc. 5th Annual ACM Symposium on Principles of Programming Languages, 131–140 (1978)Google Scholar
  4. [Cl 77/79]
    Clarke, E.M. Jr.: Programming Language constructs for which it is impossible to obtain good Hoare axiom systems, J.ACM 26, 1, 129–147 (1979)Google Scholar
  5. [Cl 79]
    Clarke, E.M. Jr.: Private letter (1979)Google Scholar
  6. [Cl 75/78]
    Cook, S.A.: Soundness and completeness of an axiomatic system for program verification. SIAM. J. Comp. 7, 1, 70–90 (1978)Google Scholar
  7. [DF 78]
    Damm, W., Fehr, E.: On the power of selfapplication and higher type recursion, in: Aussiello, G., Böhm, C. (Ed.): Automata Languages and Programming, 5th Colloquium; Udine, July 1978, 177–191 (1979)Google Scholar
  8. [Di 75]
    Dijkstra, E.W.: Guarded commands, non-determinacy and formal derivation of programs, Comm. ACM 18, 8, 453–457 (1975)Google Scholar
  9. [DO 76]
    Donahue, J.E.: Complementary definitions of programming language semantics, Springer Lecture Notes in Computer Science 42, 172 pp. (1976)Google Scholar
  10. [GGH 67]
    Ginsburg, S., Greibach, S.A., Harrison, M.A.: Stack automata and compiling, J. ACM 14, 172–201 (1967)Google Scholar
  11. [GO 75]
    Gorelick, G.A.: A complete axiomatic system for proving assertions about recursive and non-recursive programs. Tech. Rep. 75, Dept. Comp. Sc. Univ. Toronto (1975)Google Scholar
  12. [Ha 79]
    Harel, D.: First-order dynamic logic. Springer Lecture Notes in Computer Science 68, 133 pp. (1979)Google Scholar
  13. [HPS 77]
    Harel, D., Pnueli, A., Stavi, J.: A complete axiomatic system for proving deductions about recursive programs, in: Proc. 9th ACM Symposium on Theory of Computing, 249–260 (1977)Google Scholar
  14. [Ho 69]
    Hoare, C.A.R.: An axiomatic basis for computer programming, Comm. ACM 12, 576–580, 583 (1969)Google Scholar
  15. [Ho 71]
    Hoare, C.A.R.: Procedures and parameters: An axiomatic approach, in: Engeler, E. (Ed.): Symposium on Algorithmic Languages, Springer Lecture Notes in Mathematics 188, 102–116 (1971)Google Scholar
  16. [ILL 75]
    Igarashi, S., London, R.L. Luckham, D.C.: Automatic program verification I: A logical basis and its implementation. Acta Informatica 4, 145–182 (1975)Google Scholar
  17. [JW 75]
    Jensen, K., Wirth, N.: PASCAL user manual and report. Springer, New York — Heidelberg — Berlin (1975)Google Scholar
  18. [Ka 74]
    Kandzia, P.: On the "most recent" property of ALGOL-like programs, in: Springer Lecture Notes in Computer Science 14, Ed. J. Loeckx, 97–111 (1974)Google Scholar
  19. [Kl 77]
    Klein, H.-J.: Untersuchungen im Zusammenhang mit der "most recent" Eigenschaft von Programmen. Bericht Nr. 8/77, Inst. Inform. Prakt.Math.Univ. Kiel, 41 pp. (1977)Google Scholar
  20. [La 73]
    Langmaack, H.: On correct procedure parameter transmission in higher programming languages. Acta Informatica 2, 110–142 (1973)Google Scholar
  21. [La 73/74]
    Langmaack, H.: On procedures as open subroutines I, II. Acta Informatica 2, 311–333 (1973) and Acta Informatica 3, 227–241 (1974)Google Scholar
  22. [La 78]
    Langmaack, H.: On a theory of decision problems in programming languages, in: Blum, E.K., Takasu, S. (Ed.): Proceed. Internat. Conf. Math. Studies Information Processing, Kyoto 1978, Springer Lecture Notes in Computer Science 75, 538–558 (1979)Google Scholar
  23. [La 79]
    Langmaack, H.: On termination problems for finitely interpreted ALGOL-like programs. Bericht Nr. 7904, Inst. Inf. Prakt. Math. Univ. Kiel, 42 pp. (1979)Google Scholar
  24. [LLW 79]
    Langmaack, H., Lippe, W.M., Wagner, F.: The formal termination problem for programs with finite ALGOL 68-modes. Inf.Proc. Letters 9, 155–159 (1979)Google Scholar
  25. [LS 78]
    Lippe, W.M., Simon, F.: A formal notion for equivalence of ALGOL-like programs, in: Proceedings of the 3rd International Symposium on Programming in Paris: Program Transformation, ed. by B. Robinet, Dunod-Paris, 141–158 (1978)Google Scholar
  26. [Li 77]
    Lipton, R.J.: A necessary and sufficient condition for the existence of Hoare logics, in: 18th Symp. on Found. Comp. Science, ed. IEEE, 1–6 (1977)Google Scholar
  27. [McG 72]
    McGowan, C.L.: The "most recent" error: its causes and correction. SIGPLAN Notices 7, 1, 191–202 (1972)Google Scholar
  28. [Na 63]
    Naur, P. (ed.), et al.: Report on the algorithmic language ALGOL 60, Numer. Math. 4, 420–453 (1963)Google Scholar
  29. [Ol 79]
    Olderog, E.-R.: Sound and complete Hoare-like calculi based on copy rules. Bericht 7905, Inst. Inf. Prakt. Math. Univ. Kiel, 57 pp. (1979); submitted for publicationGoogle Scholar
  30. [Ol 80]
    in preparationGoogle Scholar
  31. [Pr 65]
    Prawitz, D.: Natural deduction — a proof-theoretic study. Stockholm, Almquist & Wiksell 1965Google Scholar
  32. [vW 75]
    Wijngaarden, A. van, et al. (Ed.): Revised report on the algorithmic language ALGOL 68, Acta Informatica 5, 1–236 (1975)Google Scholar
  33. [Wa 78]
    Wand, M.: A new incompleteness result for Hoare's system. J. ACM 25, 168–175 (1978)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Hans Langmaack
    • 1
  • Ernst-Rüdiger Olderog
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-Universität KielKiel 1

Personalised recommendations