On the Most Recent Property of ALGOL-Like Programs

  • P. Kandzia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


The paper is concerned with the most recent property of ALGOL-like programs, which has been discussed by Wegner and McGowan([6],[6])and dates back to Dijkstra [l]. A program has the most recent property if at run time the static chain pointer of a procedure φ always points to the most recent, not yet completed, activation of that procedure ψ which lexicographically encloses φ. A run time system cannot apply this most recent strategy for alle programs of a programming language; examples are given for BL in [5],p. 196, and for ALGOL 60 in [2], p. 108. In a main theorem McGowan gives sufficient compile time decidable conditions for the most recent correctness of a BL-program [S].




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [i]
    Dijkstra, E., “Recursive programming”, in Programming systems and languages, S. Rosen, McGraw-Hill, New York, 1967Google Scholar
  2. [2]
    Grau, A.A., Hill, U., Langmaack, H., Translation of ALGOL 60, Handbook für Automatic Computation, Vol. Ib, Berlin-HeidelbergNew York, 1967Google Scholar
  3. [3]
    Kandzia, P., Langmaack H.,“On a theorem of McGowan concerning the most recent property of programs with procedures, Berichte des Fachbereichs Angew. Math. u. Informatik, Univ. d. Saarlandes, Nr. A 74 /07, 1974Google Scholar
  4. [4]
    Langmaack, H., “On correct procedure parameter transmission in higher programming languages”, in Acta Informatica 2,110–142, 1973Google Scholar
  5. [5]
    McGowan, C.L., “The ”most recent“ error: its causes and correction”, in Proceedings of an ACM conference on proving assertions about programs, SIGPLAN Notices, Vol. 7, Number 1, 1972Google Scholar
  6. [6]
    Wegner, P.: “Three computer cultures–computer technology, computer mathematics and computer science”, Advances in Computers 10, 7–78, 1970CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • P. Kandzia

There are no affiliations available

Personalised recommendations