On the Most Recent Property of ALGOL-Like Programs
The paper is concerned with the most recent property of ALGOL-like programs, which has been discussed by Wegner and McGowan(,)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 ,p. 196, and for ALGOL 60 in , p. 108. In a main theorem McGowan gives sufficient compile time decidable conditions for the most recent correctness of a BL-program [S].
KeywordsFormal Program Original Program Execution Tree Distinguished Program Small Subtree
Unable to display preview. Download preview PDF.
- [i]Dijkstra, E., “Recursive programming”, in Programming systems and languages, S. Rosen, McGraw-Hill, New York, 1967Google Scholar
- Grau, A.A., Hill, U., Langmaack, H., Translation of ALGOL 60, Handbook für Automatic Computation, Vol. Ib, Berlin-HeidelbergNew York, 1967Google Scholar
- 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
- Langmaack, H., “On correct procedure parameter transmission in higher programming languages”, in Acta Informatica 2,110–142, 1973Google Scholar
- 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