Abstract State Machine

Concept

Abstract State Machines (ASMs), notably the Gurevich formulation, are a formal method for specifying and verifying computational systems. They have been applied to specification problems such as Broy-Lamport and used in microprocessor verification efforts including the ARM2 pipelined processor.

First seen 6/20/2026

Last seen 6/20/2026

Evidence 1 chunks

Wiki v1

WIKI

Abstract State Machine

Overview

The Abstract State Machine (ASM) is a formal specification and verification framework, most prominently associated with the Gurevich Abstract State Machine methodology. ASMs provide a means to model computational systems at an abstract level and have been applied to a range of problems including industrial microprocessor verification and classical specification benchmarks.

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

1 connections

A Methodology for Validation of Microprocessors using Equivalence Checking ← mentions 90% 1e

The paper mentions abstract state machine as used in related verification work.

LINKED ENTITIES

1 links

A Methodology for Validation of Microprocessors using Equivalence Checking MENTIONS Extracted graph relationship

CITATIONS

3 sources

3 citations — click to collapse

[1] Huggins and Campenhout used the Abstract State Machine formalism to verify the ARM2 pipelined processor. A methodology for validation of microprocessors using equivalence checking - Microprocessor Test and Verification, 2003

[2] The Gurevich Abstract State Machine methodology was applied to the Broy-Lamport specification problem. Broy-Lamport Specification Problem: A Gurevich Abstract State Machine Solution

[3] An annotated bibliography of Abstract State Machine papers was compiled for the period 1988-1998. Abstract State Machines 1988-1998: Commented ASM Bibliography