Abstract state machines

An abstract state machine (English Abstract State Machine ( ASM), not to be confused with algorithmic state machines, also formerly Evolving Algebra (EVA ) called ), is in computer science, a model for formal, operational description of algorithms. Unlike finite state machine whose states only have names, the states of an abstract state machine are general mathematical structures.

In the area of compiler construction, the model describing the semantics of the program is to be translated, and it helps ensure that the semantics of the program to be translated maintained (verify). In the development of software in general, the model allows the analysis and design phase, a formal description of the functional requirements. This mathematical approach improved, eg verifiability and reusability.

When designing complex sequential circuits is to fall back on the formalization of abstract state machines.

Origin

The inventor of the model is Yuri Gurevich of Microsoft. Based in Italy at the University of Pisa Egon Börger computer scientist explores methods for application of abstract state machines in the design and analysis of hardware and software systems.

Meanwhile, there are different implementations of the model, so the design and interpretation of programs for the abstract machine can be computerized.