Abstract State Machines: a unifying view of models of computation and of system design frameworks

Abstract We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study. 1

[1]  Yiannis N. Moschovakis,et al.  What Is an Algorithm? , 2012, SOFSEM.

[2]  Dana S. Scott.  Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..

[3]  Egon Börger,et al.  A Mathematical Definition of Full Prolog , 1995, Sci. Comput. Program..

[4]  Corrado Böhm,et al.  Flow diagrams, turing machines and languages with only two formation rules , 1966, CACM.

[5]  Egon Börger.  Specification and validation methods , 1995 .

[6]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[7]  Anthony Hall,et al.  Taking Z Seriously , 1997, ZUM.

[8]  Andreas Blass,et al.  Abstract state machines capture parallel algorithms , 2003, TOCL.

[9]  Mario Rodríguez-Artalejo,et al.  A Model for Mathematical Analysis of Functional Logic Programs and Their Implementations , 1994, IFIP Congress.

[10]  Professor Dr. Wolfgang Reisig.  Elements of Distributed Algorithms , 1998, Springer Berlin Heidelberg.

[11]  David E. Johnson,et al.  Grammar formalisms viewed as evolving algebras , 1994 .

[12]  Parasuram Anantharam.  Modelling systems , 2000, SOEN.

[13]  Manfred Broy,et al.  Mathematical Methods in Program Development , 1997, NATO ASI Series.

[14]  B. Engquist,et al.  Mathematics Unlimited: 2001 and Beyond , 2001 .

[15]  Frank Waters,et al.  The B Book , 1971 .

[16]  Egon Börger,et al.  The WAM - Definition and Compiler Correctness , 1995, Logic Programming: Formal Methods and Practical Applications.

[17]  Edsger W. Dijkstra,et al.  The structure of the “THE”-multiprogramming system , 1968, CACM.

[18]  David Lorge Parnas,et al.  Functional Documents for Computer Systems , 1995, Sci. Comput. Program..

[19]  Yuri Gurevich,et al.  Sequential abstract-state machines capture sequential algorithms , 2000, TOCL.

[20]  Robert F. Stärk,et al.  The hidden computation steps of Turbo Abstract State Machines , 2003 .

[21]  Margus Veanes,et al.  High-level executable specification of the universal plug and play architecture , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[22]  Egon Börger,et al.  Abstract State Machines. A Method for High-Level System Design and Analysis , 2003 .

[23]  Egon Börger,et al.  The Origins and the Development of the ASM Method for High Level System Design and Analysis , 2002, J. Univers. Comput. Sci..

[24]  Martin Davis,et al.  The Universal Computer: The Road from Leibniz to Turing , 2002 .

[25]  Louis Mussat,et al.  Specification and Design of a Transmission Protocol by Successive Refinements Using B1 , 1997 .

[26]  Egon Börger,et al.  High Level System Design and Analysis Using Abstract State Machines , 1998, FM-Trends.

[27]  Egon Börger,et al.  CLAM specification for provably correct compilation of CLP( R ) programs , 1993, Specification and validation methods.

[28]  Egon Börger,et al.  Java and the Java Virtual Machine: Definition, Verification, Validation , 2001 .

[29]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[30]  E. Börger.  Computation and Specification Models . A Comparative Study , 2002 .

[31]  Peter Wegner,et al.  Why interaction is more powerful than algorithms , 1997, CACM.

[32]  Egon Börger,et al.  Computability, Complexity, Logic (English translation of "Berechenbarkeit, Komplexität, Logik" from 1985) , 1989, Studies in Logic and the Foundations of Mathematics.

[33]  Christoph Beierle,et al.  Refinement of a typed WAM extension by polymorphic order-sorted types , 2005, Formal Aspects of Computing.

[34]  R. Stärk,et al.  Abstract State Machines , 2003, Springer Berlin Heidelberg.

[35]  Kenneth W. Regan,et al.  Computability , 2022, Algorithms and Theory of Computation Handbook.

[36]  Christoph Beierle,et al.  Specification and correctness proof of a WAM extension with abstract type constraints , 2005, Formal Aspects of Computing.

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

[38]  Yuri Gurevich,et al.  Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[39]  Egon Börger,et al.  A Neural Abstract Machine , 2001, J. Univers. Comput. Sci..

[40]  Peter Gorm Larsen,et al.  Modelling Systems: Practical Tools and Techniques in Software Development , 1998 .

[41]  Egon Börger,et al.  Architecture Design and Validation Methods , 2012, Springer Berlin Heidelberg.

[42]  Egon Börger,et al.  Correctness of Compiling Occam to Transputer Code , 1996, Comput. J..

[43]  Jean-Raymond Abrial,et al.  Introducing Dynamic Constraints in B , 1998, B.

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

[45]  Luciano Lavagno,et al.  Models of computation for system design , 2000 .

[46]  K. Mani Chandy.  Parallel program design , 1989 .

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

[48]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[49]  Berndt Farwer,et al.  ω-automata , 2002 .

[50]  L. M. G. Feijs,et al.  Formal Specification and Design , 1992 .

[51]  Jörn W. Janneck,et al.  Syntax and semantics of graphs , 2000 .

[52]  Yuri Gurevich,et al.  Recursive Abstract State Machines , 2017, J. Univers. Comput. Sci..

[53]  Egon Börger,et al.  Composition and Submachine Concepts for Sequential ASMs , 2000, CSL.