Access the full text.
Sign up today, get DeepDyve free for 14 days.
Composite interactive algorithms (tentative title) In preparation (b)
(2007)
Composite interactive algorithms (tentative title) In preparation
A. Blass, Y. Gurevich (2007)
Ordinary interactive small-step algorithms, IACM Trans. Comput. Log., 7
(2007)
Composite interactive algorithms
A. Blass, Y. Gurevich, D. Rosenzweig, Benjamin Rossman (2005)
General Interactive Small Step Algorithms
(2007)
Interactive wide-step algorithms (tentative title) In preparation
(2004)
Article 15, Publication date
R. Stärk, Stanislas Nanchen (2001)
A Logic for Abstract State Machines
Interactive smallstep algorithms, I and II
ASM guide
Y. Gurevich (1995)
Evolving algebras 1993: Lipari guideArXiv, abs/1808.06255
The AsmL webpage, http://research.microsoft.com/foundations/AsmL
Interactive widestep algorithms (tentative title) In preparation (c)
Composite interactive algorithms ( tentative title ) In preparation ( b ) . Yuri Gurevich 1995 . Evolving algebra 1993 : Lipari guide
(2005)
ACM Transactions on Computational Logic
(1997)
ASM guide. Univ. of Michigan Technical Report CSE-TR-336-97
A. Blass, Y. Gurevich (2007)
Ordinary interactive small-step algorithms, IIIACM Trans. Comput. Log., 8
Gurevich Ordinary Interactive Small-Step Algorithms
A. Blass, Y. Gurevich (2003)
Abstract state machines capture parallel algorithmsACM Trans. Comput. Log., 4
Y. Gurevich (2000)
Sequential abstract-state machines capture sequential algorithmsACM Trans. Comput. Log., 1
ASM guide Univ
(2007)
Interactive wide-step algorithms
Gurevich
(1997)
ASM guide University of Michigan. CSE-TR-336-97
ASM Michigan webpage
The verification that the postulates are satisfied, including the construction of the bounded exploration witness, is just as for conditional rules
(2004)
Received August
This is the second in a series of three articles extending the proof of the Abstract State Machine Thesis---that arbitrary algorithms are behaviorally equivalent to abstract state machines---to algorithms that can interact with their environments during a step, rather than only between steps. As in the first article of the series, we are concerned here with ordinary, small-step, interactive algorithms. This means that the algorithms: (1) proceed in discrete, global steps, (2) perform only a bounded amount of work in each step, (3) use only such information from the environment as can be regarded as answers to queries, and (4) never complete a step until all queries from that step have been answered. After reviewing the previous article's formal description of such algorithms and the definition of behavioral equivalence, we define ordinary, interactive, small-step abstract state machines (ASMs). Except for very minor modifications, these are the machines commonly used in the ASM literature. We define their semantics in the framework of ordinary algorithms and show that they satisfy the postulates for these algorithms. This material lays the groundwork for the final article in the series, in which we shall prove the Abstract State Machine thesis for ordinary, intractive, small-step algorithms: All such algorithms are equivalent to ASMs.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jul 1, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.