Recursive Abstract State Machines

According to the ASM thesis, any algorithm is essentially a Gurevich abstract state machine. The only objection to this thesis, at least in its sequential version, has been that ASMs do not capture recursion properly. To this end, we suggest recursive ASMs.

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

[2]  Egon Börger,et al.  Annotated bibliography on evolving algebras , 1995, Specification and validation methods.

[3]  Yuri Gurevich,et al.  Gurevich Abstract State Machines and Schoenhage Storage Modification Machines , 1997, J. Univers. Comput. Sci..

[4]  Yuri Gurevich,et al.  Evolving Algebras: an Attempt to Discover Semantics , 1993, Current Trends in Theoretical Computer Science.