Acta Informatica

, Volume 18, Issue 1, pp 79–108 | Cite as

On termination problems for finitely interpreted ALGOL-like programs

  • Hans Langmaack


Main issue is: The actual termination problem for finitely interpreted non-deterministic ALGOL-like programs without procedure selfapplication and without global variables is algorithmically solvable. This result offers a new and substantial application of a theorem of Lipton: The above mentioned programs, restricted to deterministic ones, have a sound and relatively complete Hoare logic. So we conjecture: ALGOL-like programs (even non-deterministic ones with formal sharing of variables) without procedure selfapplication and without global variables have a sound and relatively complete Hoare deduction system with axioms and inference rules which reflect the syntactical structure of programs.


Information System Operating System Data Structure Communication Network Information Theory 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Apt, K.R.: A sound and complete Hoare-like system for a fragment of PASCAL. Math. Centrum IW 96/78, Amsterdam, 59 pp. 1978Google Scholar
  2. 2.
    Apt, K.R.: Ten years of Hoare's logic: A survey-part I. Fac. Econom., Erasmus Univ. Rotterdam, 43 pp. 1979; ACM TOPLAS3, 431–483 (1981)Google Scholar
  3. 3.
    Büchi, J.R.: Regular canonical systems. Arch. Math. Logik Grundlagenforsch.6, 91–111 (1964)Google Scholar
  4. 4.
    Clarke, E.M., Jr.: Programming Language constructs for which it is impossible to obtain good Hoare axiom systems. J. ACM26, 1, 129–147 (1979)Google Scholar
  5. 5.
    Clarke, E.M., Jr.: Private letter (1979)Google Scholar
  6. 6.
    Clarke, E.M., Jr., German, S.M., Halpern, J.Y.: Effective Axiomatizations of Hoare Logics. Manuscript 1981. Will be published in J. ACMGoogle Scholar
  7. 7.
    Cook, S.A.: Soundness and completeness of an axiomatic system for program verification. SIAM J. Comput.7, 1, 70–90 (1978)Google Scholar
  8. 8.
    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, Springer LNCS, Vol. 68, 177–191 (1978)Google Scholar
  9. 9.
    Dijkstra, E.W.: Recursive programming. Numer. Math.2, 312–318 (1960)Google Scholar
  10. 10.
    Dijkstra, E.W.: Guarded commands, non-determinacy and formal derivation of programs. Comm. ACM18, 8, 453–457 (1975)Google Scholar
  11. 11.
    Ginsburg, S., Greibach, S.A., Harrison, M.A.: Stack automata and compiling. J. ACM14, 172–201 (1967)Google Scholar
  12. 12.
    Gorelick, G.A.: A complete axiomatic system for proving assertions about recursive and nonrecursive programs. Tech. Rep. 75, Dept. Comput. Sci. Univ. Toronto 1975Google Scholar
  13. 13.
    Grau, A.A., Hill, U., Langmaack, H.: Translation of ALGOL 60. Handbook for Automatic Computation, Ib, Springer, Berlin, Heidelberg, New York 1967 14.Google Scholar
  14. 14.
    Harel, D.: First order dynamic logic. Lecture Notes Comput. Sci. 68. Springer, Berlin, Heidelberg, New York 1979Google Scholar
  15. 15.
    Jensen, K., Wirth, N.: PASCAL user manual and report. Springer, Berlin, Heidelberg, New York 1975Google Scholar
  16. 16.
    Kandzia, P.: On the ‘most recent’ property of ALGOL-like programs. In: Lectzre Notes Comput. Sci. 14, (Ed.) J. Loeckx, 97–111. Springer, Berlin, Heidelberg, New York 1974Google Scholar
  17. 17.
    Langmaack, H.: On correct procedure parameter transmission in higher programming languages. Acta Informat.2, 110–142 (1973)Google Scholar
  18. 18.
    Langmaack, H.: On procedures as open subroutines I. Acta Informat.2, 311–333 (1973)Google Scholar
  19. 19.
    Langmaack, H.: On procedures as open subroutines II. Acta Informat.3, 227–241 (1974)Google Scholar
  20. 20.
    Langmaack, H.: Zum Begriff der Modularität von Programmiersprachen. In: Lecture Notes Comput. Sci. 7, (Eds.) B. Schlender, W. Frielinghaus, 1–12. Springer, Berlin, Heidelberg, New York 1974Google Scholar
  21. 21.
    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. RIMS Kyoto University, August 1978; Springer Lecture Notes Comput. Sci.75, 538–559 (1979)Google Scholar
  22. 22.
    Langmaack, H.: A proof of a theorem of Lipton on Hoare logic and applications. Bericht 8003, Inst. Inf. Prakt. Math. Univ. Kiel 1980Google Scholar
  23. 23.
    Langmaack, H., Lippe, W.M., Wagner, F.: The formal termination problem for programs with finite ALGOL 68-modes. Information Processing Lett.9, 155–159 (1979)Google Scholar
  24. 24.
    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: Proceed. Autom. Lang. Progr., 7th Coll., Noordwijkerhout, July 1980. Springer LNCS,85, 363–373 (1980)Google Scholar
  25. 25.
    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. 26.
    Lipton, R.J.: A necessary and sufficient condition for the existence of Hoare logics. In: 18th Symp. Found. Comput. Sci., Ed. IEEE Comp. Soc, IEEE 77 CH1278-1C 1–6 (1977)Google Scholar
  27. 27.
    McGowan, C.L.: The ‘most recent’ error: its causes and correction. SIGPLAN Notices7, 1, 191–202 (1972)Google Scholar
  28. 28.
    Naur, P. (ed.), et al.: Report on the algorithmic language ALGOL 60. Numer. Math.4, 420–453 (1963)Google Scholar
  29. 29.
    Olderog, E.R.: Sound and complete Hoare-like calculi based on copy rules. Bericht 7905, Inst. Inf. Prakt. Math. Univ. Kiel, 57 pp. 1979, Acta Informat.16, 161–197 (1981)Google Scholar
  30. 30.
    Randell, B., Russell, L.J.: ALGOL 60 implementation. London: Academic Press 1964Google Scholar
  31. 31.
    Wijngaarden, A. van, et al. (Ed.): Revised report on the algorithmic languages ALGOL 68. Acta Informat.5, 1–3, 1–236 (1975)Google Scholar
  32. 32.
    Winklmann, K.A.: A theoretical study of some aspects of parameter passing in ALGOL 60 and in similar programming languages. Doct. Thesis, Purdue Univ., Lafayette, Ind. 1977Google Scholar

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • Hans Langmaack
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-Universität KielKiel 1Bundesrepublik Deutschland

Personalised recommendations