Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem

DOI10.2168/LMCS-3(4:4)2007MaRDI QIDQ5453497zbMATH OpenOpenAlexFDO

Authors Andreas Blass, Dean Rosenzweig, Benjamin Rossman, Yuri Gurevich

Publication date 1 April 2008

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-3(4:4)2007

zbMATH Keywords

extended abstract state machinesinteractive small-step algorithms

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)

Recommendations

• Interactive Small-Step Algorithms I: Axiomatization
• Ordinary interactive small-step algorithms, II
• Ordinary interactive small-step algorithms, III
• Ordinary interactive small-step algorithms. I
• scientific article; zbMATH DE number 1860674

Cited in

(13)

• Sequential abstract-state machines capture sequential algorithms
• Classes of algorithms: formalization and comparison
• Ordinary interactive small-step algorithms. I
• Abstract state machines capture parallel algorithms: correction and extension
• What is the natural abstraction level of an algorithm?
• Persistent queries in the behavioral theory of algorithms
• Abstract State Machines 2004. Advances in Theory and Practice
• Exact exploration and hanging algorithms
• Concurrent abstract state machines
• Abstract state machines capture parallel algorithms
• Interactive Small-Step Algorithms I: Axiomatization
• Ordinary interactive small-step algorithms, II
• Ordinary interactive small-step algorithms, III

This page was built for publication: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem

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