Recursive Abstract State Machines
Yuri Gurevich (University of Michigan, USA)
Marc Spielmann (RWTH Aachen, Germany)
Abstract: 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.) Partially supported by NSF grant CCR 95-04375 and ONR grant N00014-94-1-1182.
2.) Visiting scholar at the University of Michigan, partially supported by DAAD and The University of Michigan.
Keywords: abstract state machines, concurrency, distributed computations, recursion
Categories: F.1.1, F.1.2