Sequential abstract-state machines capture sequential algorithms

Recommendations

scientific article; zbMATH DE number 1860674
scientific article; zbMATH DE number 1343482
Abstract state machines capture parallel algorithms: correction and extension
On Gurevich's theorem on sequential algorithms
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem

Cited in

(65)

The never-ending recursion
Proving properties of the Chord protocol using the ASM formalism
Abstract state machines: a unifying view of models of computation and of system design frameworks
Axiomatization and characterization of BSP algorithms
Is there any real substance to the claims for a ``new computationalism?
Communities and ancestors associated with Egon Börger and ASM
ASM specification and refinement of a quantum algorithm
What is the natural abstraction level of an algorithm?
Computation on structures. Behavioural theory, logic, complexity
Computable execution traces
Test generation from event system abstractions to cover their states and transitions
Database query processing using finite cursor machines
Periodicity based decidable classes in a first order timed logic
Operational semantics for declarative multi-paradigm languages
A guarded fragment for abstract state machines
Semantic essence of AsmL
Symbioses between mathematical logic and computer science
Execution trace sets for real computation
What is an algorithm?
Honest universality
Concurrent abstract state machines
A proof system with bounded non-determinism in database transformations
A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
ASM-based formal design of an adaptivity component for a cloud system
Rete network slicing for model queries
Axiomatizing analog algorithms
Abstract state machines for data-parallel computing
Honest computability and complexity
An abstract machine for the old value retrieval
Three paths to effectiveness
ASMs and operational algorithmic completeness of lambda calculus
Fixed-point definability and polynomial time on chordal graphs and line graphs
Abstract state machines and the inquiry process
Exact exploration and hanging algorithms
A Natural Axiomatization of Computability and Proof of Church's Thesis
When are Two Algorithms the Same?
On-the-fly algorithms and sequential machines
Programming in logic without logic programming
Algorithms: From Al-Khwarizmi to Turing and Beyond
Theses for computation and recursion on concrete and abstract structures
Semantics-to-Syntax Analyses of Algorithms
scientific article; zbMATH DE number 1860674 (Why is no real title available?)
Formalizing operational semantic specifications in logic
A behavioural theory of recursive algorithms
Cellular automata are generic
A Survey on Analog Models of Computation
A characterization of distributed ASMs with partial-order runs
What is the Church-Turing Thesis?
Physical computational complexity and first-order logic
Abstract state machines capture parallel algorithms
On-the-Fly Algorithms and Sequential Machines
Towards a Logic for Abstract MetaFinite State Machines
The Church-Turing Thesis over Arbitrary Domains
A logic for secure memory access of abstract state machines
Distributed Adaptive Systems
Software science view on quantum circuit algorithms
Reactive Answer Set Programming
Information systems in modeling interactive computations on granules
Theoretical computer science: computability, decidability and logic
Insignificant choice polynomial time. A logic capturing PTIME
A calculus for the specification, design, and verification of distributed concurrent systems
Reversify any sequential algorithm
In some curved spaces, one can solve NP-hard problems in polynomial time
Can abstract state machines be useful in language theory?
The computable kernel of abstract state machines

This page was built for publication: Sequential abstract-state machines capture sequential algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738899)