Abstract state machines capture parallel algorithms

DOI10.1145/937555.937561zbMath1365.68253OpenAlexW2125522861MaRDI QIDQ5267442

Andreas Blass, Yuri Gurevich

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

zbMATH Keywords

parallel algorithmabstract state machineASM thesispostulates for parallel computation

Mathematics Subject Classification ID

Related Items (18)

Distributed Adaptive Systems ⋮ What Is an Algorithm? ⋮ Concurrent abstract state machines ⋮ Symbioses between mathematical logic and computer science ⋮ A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis ⋮ Can abstract state machines be useful in language theory? ⋮ Software science view on quantum circuit algorithms ⋮ Information systems in modeling interactive computations on granules ⋮ Semantics-to-Syntax Analyses of Algorithms ⋮ Axiomatization and characterization of BSP algorithms ⋮ A unifying logic for non-deterministic, parallel and concurrent abstract state machines ⋮ Towards a Logic for Abstract MetaFinite State Machines ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ A Behavioural Theory of Recursive Algorithms ⋮ A Mathematical Model of Parallel Programs and an Approach Based on it to Verification of MPI Programs ⋮ ASM specification and refinement of a quantum algorithm ⋮ What is the natural abstraction level of an algorithm? ⋮ Computation on structures. Behavioural theory, logic, complexity

This page was built for publication: Abstract state machines capture parallel algorithms