Typed Abstract State Machines

Giuseppe Del Castillo, Yuri G. Gurevich, Karl A. Stroetmann · 1998

As introduced in the Lipari guide, Abstract State Machines (abbreviated as ASMs) are untyped. This is useful for many purposes. However, typed languages have their own advantages. Types structure the data, type checking uncovers errors. Here we propose a typed version of ASMs. Key Words: abstract state machine, type

Read the paper · More papers on PaperTik