Evolving Algebras 1993: Lipari Guide
arXiv:1808.06255
Abstract
Computation models and specification methods seem to be worlds apart. The project on abstract state machines (in short ASMs, also known as evolving algebras) started as an attempt to bridge the gap by improving on Turing's thesis. We sought more versatile machines which would be able to step-for-step simulate arbitrary algorithms on their natural abstraction levels. The ASM thesis asserts that ASMs are such versatile machines. The guide provides the definitions of sequential, parallel and distributed ASMs.
The paper is published in arXiv because the Oxford University Press book is not available, Specification and Validation Methods, editor Egon Boerger, Oxford University Press, 1995
Cited by in corpus (11)
- Behavioural Theory of Reflective Algorithms I: Reflective Sequential Algorithms
- Evolving Algebras and Partial Evaluation
- Abstract State Machines 1988-1998: Commented ASM Bibliography
- Semantics of Programming Languages: A Tool-Oriented Approach
- A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
- Broy-Lamport Specification Problem: A Gurevich Abstract State Machine Solution
- Insignificant Choice Polynomial Time: A Logic Capturing PTIME
- An Offline Partial Evaluator for Evolving Algebras
- Equivalence is in the Eye of the Beholder
- Towards the Notion of an Abstract Quantum Automaton
- Description of the Chord Protocol using ASMs Formalism