Examples of sequential abstract state machines (ASMs, for short) specifying some familiar algorithms. Proof of sequential ASM thesis which states that all sequential algorithms can be captured by sequential ASMs. Computations with abstract structures, choiceless polynomial time. ASM specification of parallel and distributed algorithms. ASM methodology for specifying semantics of programming languages, and for verification. Comparison of ASM approach with other existing methodologies for specification and verification. ASM defined fine complexity classes. ASMs and meta-finite models.
No text available. Oneline material available at the Michigan webpage on ASMs: http://www.eecs.umich.edu/gasm/