Skip to search formSkip to main contentSkip to account menu

Abstract state machines

Known as: ASM, Abstract State Machine, Evolving Algebras 
In computer science, an abstract state machine (ASM) is a state machine operating on states which are arbitrary data structures (structure in the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Review
2003
Review
2003
1 Introduction.- 1.1 Goals of the Book and Contours of its Method.- 1.1.1 Stepwise Refinable Abstract Operational Modeling.- 1.1… 
Highly Cited
2003
Highly Cited
2003
The notion of Abstract State Machines (ASMs), defined in [20], captures in mathematically rigorous yet transparent form some… 
Highly Cited
2003
Highly Cited
2003
We give an axiomatic description of parallel, synchronous algorithms. Our main result is that every such algorithm can be… 
Highly Cited
2003
Highly Cited
2003
Highly Cited
2002
Highly Cited
2002
We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This… 
Highly Cited
2000
Highly Cited
2000
We examine sequential algorithms and formulate a sequential-time postulate, an abstract-state postulate, and a bounded… 
Highly Cited
1995
Highly Cited
1995
Introduction. 1.: Evolving algebras 1993. Lipari guide. 2.: Annotated bibliography on evolving algebras. 3.: Program verification… 
Highly Cited
1993
Highly Cited
1993
  • Y. Gurevich
  • Specification and validation methods
  • 1993
  • Corpus ID: 15580311
2 Static Algebras and Updates 4 2.1 Static Algebras: Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4… 
Review
1992
Review
1992
We present formal operational semantics for the C programming language. Our starting point is the ANSI standard for C as…