Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,258,725 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Algorithm
Axiomatic system
Church–Turing thesis
Computer hardware
Expand
Broader (1)
Formal methods
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
A Compositional Framework for Service Interaction Patterns and Interaction Flows
A. Barros
,
E. Börger
IEEE International Conference on Formal…
2005
Corpus ID: 5891032
We provide precise high-level models for eight fundamental service interaction patterns, together with schemes for their…
Expand
Highly Cited
2003
Highly Cited
2003
Abstract State Machines
R. Stärk
,
J. Schmid
,
E. Börger
2003
Corpus ID: 264626351
The notion of Abstract State Machines (ASMs), defined in [20], captures in mathematically rigorous yet transparent form some…
Expand
Highly Cited
2003
Highly Cited
2003
Abstract state machines capture parallel algorithms
A. Blass
,
Y. Gurevich
TOCL
2003
Corpus ID: 9915665
We give an axiomatic description of parallel, synchronous algorithms. Our main result is that every such algorithm can be…
Expand
Highly Cited
2003
Highly Cited
2003
Semantic essence of AsmL
Y. Gurevich
,
Benjamin Rossman
,
Wolfram Schulte
Theoretical Computer Science
2003
Corpus ID: 1028507
Review
2003
Review
2003
The formal semantics of SDL-2000: Status and perspectives
U. Glässer
,
R. Gotzhein
,
A. Prinz
Comput. Networks
2003
Corpus ID: 15004272
Highly Cited
2002
Highly Cited
2002
Generating finite state machines from abstract state machines
W. Grieskamp
,
Y. Gurevich
,
Wolfram Schulte
,
Margus Veanes
International Symposium on Software Testing and…
2002
Corpus ID: 8168579
We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This…
Expand
Highly Cited
2001
Highly Cited
2001
A Logic for Abstract State Machines
R. Stärk
,
Stanislas Nanchen
Journal of universal computer science (Online)
2001
Corpus ID: 11014744
We introduce a logic for sequential, non distributed Abstract State Machines. Unlike other logics for ASMs which are based on…
Expand
2001
2001
Verification of Abstract State Machines
R. Stärk
2001
Corpus ID: 14457165
Gurevich’s Abstract State Machines (ASMs) are widely used for the specification of software, hardware and algorithms and for the…
Expand
Review
2000
Review
2000
Problem-Solving Methods
D. Fensel
Lecture Notes in Computer Science
2000
Corpus ID: 42449719
What Are Problem-Solving Methods.- Making Assumptions for Efficiency Reasons.- What Are Problem-Solving Methods.- Making…
Expand
Highly Cited
1995
Highly Cited
1995
The WAM - Definition and Compiler Correctness
E. Börger
,
D. Rosenzweig
Logic Programming: Formal Methods and Practical…
1995
Corpus ID: 6361365
This paper provides a mathematical analysis of the Warren Abstract Machine for executing Prolog and a correctness proof for a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE