Abstract state machines capture parallel algorithms
From MaRDI portal
(Redirected from Publication:5267442)
Recommendations
- Abstract state machines capture parallel algorithms: correction and extension
- Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
- Sequential abstract-state machines capture sequential algorithms
- Concurrent abstract state machines
Cited in
(31)- Reversify any sequential algorithm
- Semantics-to-Syntax Analyses of Algorithms
- scientific article; zbMATH DE number 1951194 (Why is no real title available?)
- A behavioural theory of recursive algorithms
- ASM specification and refinement of a quantum algorithm
- Computation on structures. Behavioural theory, logic, complexity
- What is the natural abstraction level of an algorithm?
- Axiomatization and characterization of BSP algorithms
- Software science view on quantum circuit algorithms
- Symbioses between mathematical logic and computer science
- Concurrent abstract state machines
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
- Distributed Adaptive Systems
- Theoretical computer science: computability, decidability and logic
- scientific article; zbMATH DE number 1670467 (Why is no real title available?)
- Can abstract state machines be useful in language theory?
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- scientific article; zbMATH DE number 1820018 (Why is no real title available?)
- Towards a Logic for Abstract MetaFinite State Machines
- A vegetative machine
- scientific article; zbMATH DE number 1696883 (Why is no real title available?)
- Abstract state machines for data-parallel computing
- Study of stepwise simulation between ASM
- Information systems in modeling interactive computations on granules
- Abstract state machines capture parallel algorithms: correction and extension
- P-functions and Boolean matrix factorization. A unified approach for wired, programmed and microprogrammed implementations of discrete algorithms
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- A Mathematical Model of Parallel Programs and an Approach Based on it to Verification of MPI Programs
- scientific article; zbMATH DE number 2162121 (Why is no real title available?)
- Axiomatizing analog algorithms
- What is an algorithm?
This page was built for publication: Abstract state machines capture parallel algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267442)