Abstract state machines capture parallel algorithms
From MaRDI portal
Publication:5267442
DOI10.1145/937555.937561zbMATH Open1365.68253OpenAlexW2125522861WikidataQ130965820 ScholiaQ130965820MaRDI QIDQ5267442FDOQ5267442
Publication date: 13 June 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/937555.937561
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)
Cited In (27)
- Semantics-to-Syntax Analyses of Algorithms
- Title not available (Why is that?)
- ASM specification and refinement of a quantum algorithm
- Computation on structures. Behavioural theory, logic, complexity
- What is the natural abstraction level of an algorithm?
- What Is an Algorithm?
- Axiomatization and characterization of BSP algorithms
- Software science view on quantum circuit algorithms
- Symbioses between mathematical logic and computer science
- Distributed Adaptive Systems
- Theoretical computer science: computability, decidability and logic
- Concurrent abstract state machines
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
- Title not available (Why is that?)
- Can abstract state machines be useful in language theory?
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- Title not available (Why is that?)
- A unifying logic for non-deterministic, parallel and concurrent abstract state machines
- Towards a Logic for Abstract MetaFinite State Machines
- Title not available (Why is that?)
- A vegetative machine
- A Behavioural Theory of Recursive Algorithms
- Information systems in modeling interactive computations on granules
- 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
- Title not available (Why is that?)
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)