An ALGOL-View on Turbo ASM

The transition from basic ASMs to Turbo ASMs reminds at the earlier transition from programming languages like FORTRAN and ALGOL58 to ALGOL60. Essential new features are on the ASM-side naming, parameterizing, local states and possible return values of rules and were on the ALGOL60-side procedures, block concept and function procedures with return values. Turbo ASM–theory and ALGOL60 have two central phenomena in common: Operational style of specifying and semantics definition and named rules and procedures with their potential of recursion. There are quite a few connections between Turbo ASM and ALGOL60. The close coupling of operational style and recursion becomes especially evident in Apt’s and Olderog’s proof of soundness of Hoare’s deduction rule for recursive ASM–rule resp. procedure calls.

[1]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[2]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[3]  Egon Börger,et al.  Abstract State Machines , 2003 .

[4]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[5]  Egon Börger,et al.  Remarks on Turbo ASMs for Functional Equations and Recursion Schemes , 2003, Abstract State Machines.

[6]  J. W. Backus,et al.  The FORTRAN automatic coding system , 1899, IRE-AIEE-ACM '57 (Western).

[7]  Angelo Gargantini,et al.  Abstract State Machines 2003 , 2003, Lecture Notes in Computer Science.

[8]  Robert F. Stärk,et al.  The Hidden Computation Stepsof Turbo Abstract State Machines , 2003, Abstract State Machines.

[9]  A. M. Turing,et al.  Checking a large routine , 1989 .

[10]  Niklaus Wirth,et al.  Pascal User Manual and Report , 1991, Springer New York.

[11]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.

[12]  J. Schwartz.  Mathematical Aspects of Computer Science , 1967 .

[13]  Ernst-Rüdiger Olderog,et al.  Sound and complete Hoare-like calculi based on copy rules , 1981, Acta Informatica.

[14]  Friedrich L. Bauer,et al.  Sequentielle Formelübersetzung , 1959, Elektron. Rechenanlagen.

[15]  Edmund M. Clarke,et al.  Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems , 1979, JACM.

[16]  Clement L. McGowan.  The “most recent” error: Its causes and correction , 1972 .

[17]  Hans Hermes.  Aufzählbarkeit Entscheidbarkeit Berechenbarkeit , 1961 .

[18]  Arnd Poetzsch-Heffter,et al.  A Programming Logic for Sequential Java , 1999, ESOP.

[19]  Robert F. Stärk,et al.  A Logic for Abstract State Machines , 2001, J. Univers. Comput. Sci..

[20]  Ernst-Rüdiger Olderog,et al.  Correctnes of Programs with Pascal-Like Procedures without Global Variables , 1984, Theor. Comput. Sci..

[21]  Hans Langmaack,et al.  On correct procedure parameter transmission in higher programming languages , 1973, Acta Informatica.

[22]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[23]  E. Dijkstra,et al.  Recursive Programming , 1960 .

[24]  Friedrich L. Bauer,et al.  Report on the algorithmic language ALGOL 60 , 1960, Commun. ACM.

[25]  C. A. R. Hoare,et al.  Procedures and parameters: An axiomatic approach , 1971, Symposium on Semantics of Algorithmic Languages.

[26]  Peter Kandzia,et al.  On the Most Recent Property of Algol-Like Programs , 1974, ICALP.

[27]  Prof. Dr. Robert F. Stärk,et al.  Java and the Java Virtual Machine , 2001, Springer Berlin Heidelberg.

[28]  Ernst-Rüdiger Olderog,et al.  Present-Day Hoare-Like Systems for Programming Languages with Procedures: Power, Limits and most Likely Expressions , 1980, ICALP.

[29]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[30]  Hans Langmaack,et al.  On procedures as open subroutines. II , 1974, Acta Informatica.

[31]  Hans Langmaack.  Klaus Samelsons frühe Beiträge zur Informatikentwicklung , 2002, Informatik-Spektrum.

[32]  Richard J. Lipton,et al.  A necessary and sufficient condition for the existence of hoare logics , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[33]  E. Engeler.  Symposium on Semantics of Algorithmic Languages , 1971, Symposium on Semantics of Algorithmic Languages.

[34]  Andrzej Salwicki,et al.  Algorithmic Logic , 1987 .

[35]  Michael Hucka,et al.  Programmer's Manual , 2004 .

[36]  J. W. de Bakker,et al.  Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.

[37]  Hans Langmaack.  On termination problems for finitely interpreted ALGOL-like programs , 2004, Acta Informatica.