Interactive Small-Step Algorithms I: Axiomatization

DOI10.2168/LMCS-3(4:3)2007MaRDI QIDQ5453496zbMATH OpenFDO

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:3)2007

zbMATH Keywords

axiomatizationinteractive small-step algorithms

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)

Recommendations

• Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
• Ordinary interactive small-step algorithms, II
• Ordinary interactive small-step algorithms, III
• Ordinary interactive small-step algorithms. I
• Abstract State Machines 2004. Advances in Theory and Practice

Cited in

(15)

• What is an algorithm?
• Persistent queries in the behavioral theory of algorithms
• Concurrent abstract state machines
• Reactive Turing machines
• A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
• Reactive Turing machines
• Semantics-to-Syntax Analyses of Algorithms
• Interactive Algorithms 2005 with Added Appendix
• Ordinary interactive small-step algorithms. I
• Ordinary interactive small-step algorithms, II
• Ordinary interactive small-step algorithms, III
• Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
• Abstract State Machines 2004. Advances in Theory and Practice
• Software science view on quantum circuit algorithms
• Reversify any sequential algorithm

Describes a project that uses

Uses Software

• AsmL

This page was built for publication: Interactive Small-Step Algorithms I: Axiomatization

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