## Exact Exploration and Hanging Algorithms ⋆

Citations: | 7 - 7 self |

### BibTeX

@MISC{Blass_exactexploration,

author = {Andreas Blass and Nachum Dershowitz and Yuri Gurevich},

title = {Exact Exploration and Hanging Algorithms ⋆},

year = {}

}

### OpenURL

### Abstract

Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sequential algorithm, there is an abstract state machine (ASM) with the same states, initial states and state transitions. That analysis, however, abstracted from details of intra-step computation, and the ASM, produced in the proof of the representation theorem, may and often does explore parts of the state unexplored by the algorithm. We refine the analysis, the axiomatization and the representation theorem. Emulating a step of the given algorithm, the ASM, produced in the proof of the new representation theorem, explores exactly the part of the state explored by the algorithm. That frugality pays off when state exploration is costly. The algorithm may be a high-level specification, and a simple function call on the abstraction level of the algorithm may hide expensive interaction with the environment. Furthermore, the original analysis presumed that state functions are total. Now we allow state functions, including equality, to be partial so that a function call may cause the algorithm as well as the ASM to hang. Since the emulating ASM does not make any superfluous function calls, it hangs only if the algorithm does. [T]he monotony of equality can only lead us to boredom. —Francis Picabia 1

### Citations

419 | Evolving algebras 1993: Lipari guide
- Gurevich
- 1993
(Show Context)
Citation Context ...neralized to computations that may be vastly parallel, distributed, real-time. In the rest of this paper, algorithms are by default sequential and deterministic. In particular abstract state machines =-=[12]-=- will be by default sequential and deterministic. Abstract state machines (ASMs) constitute a most general model of (sequential deterministic) computation. They operate on any level of abstraction of ... |

395 |
On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness
- BLUM, SHUB, et al.
- 1989
(Show Context)
Citation Context ...sical mathematics has no philosophical objections to working with various ideal elements that do not have finite representations. The BSS model of computation with real numbers reflects that attitude =-=[4]-=-, and ASMs have been used in to emulate the BSS model [24]. On the other hand, constructive mathematics works only with objects that have finite representations. In their world, only computable reals ... |

119 | Sequential abstract state machines capture sequential algorithms
- Gurevich
- 2000
(Show Context)
Citation Context ...DMS-0653696. Dershowitz was partially supported by Israel Science Foundation grant 250/05. Part of the work reported here was performed during visits of the first two authors to Microsoft.Theorem of =-=[13]-=-, any algorithm can be step-by-step emulated by an ASM. The theorem presupposes a precise notion of algorithm, and indeed algorithms are axiomatized by means of three “sequential postulates” in [13]. ... |

55 | A Logic for Abstract State Machines
- Stark, Nanchen
(Show Context)
Citation Context ...lenbach for information on computable reals. 32 Related Work Exact exploration that we preach here has been practiced by ASM experts for a long time, in various applications in academia and industry =-=[1,7,25]-=-. ASMs, sequential and otherwise, have been used to give high-level operational semantics to programming languages, protocol specifications, etc. In Microsoft, the ASM approach was used to develop Spe... |

53 | To the Definition of an Algorithm - Kolmogorov, Uspensky - 1958 |

23 | A natural axiomatization of computability and proof of Church’s Thesis - Dershowitz, Gurevich |

23 |
A theory of algorithms
- Markov
- 1954
(Show Context)
Citation Context ...when two computable reals are equal is of course undecidable. Would ASMs be of any use to constructivists? We think so. Russian constructivists often used Markov’s normal algorithms computation model =-=[18]-=- for programming. As a result some of their works are unnecessarily detailed and hard to read. Exacting ASMs would fit their purposes better. You don’t have to be a constructivist to be interested in ... |

18 |
Lectures on constructive mathematical analysis
- Kushner
- 1984
(Show Context)
Citation Context ...ave varying costs involved, and/or for which their domains of applicability may be unknown or uncomputable. The latter produces an ocean of related work. First, constructive mathematics comes to mind =-=[3,16]-=-. Classical mathematics has no philosophical objections to working with various ideal elements that do not have finite representations. The BSS model of computation with real numbers reflects that att... |

13 |
A survey of exact arithmetic implementations
- Gowland, Lester
(Show Context)
Citation Context ...ulties in abstract data types and programming semantics; see [2,19] for interesting examples of that approach. There exist a number of implementations of arithmetic with infinite-precision reals; see =-=[11]-=- for a survey. As far as we can determine, the most advanced and rapid implementations of exact real number arithmetic today are the iRRAM system of Norbert Müller [22] and the RealLib system by Brani... |

12 | Continuous-space model of computation is Turing universal
- Naughton
- 2000
(Show Context)
Citation Context ... have to be a constructivist to be interested in computable mathematical analysis; you may be a recursion theorist [28]. One way to deal with partial-equality troubles is to avoid equality altogether =-=[15,23]-=-. Algebraic semantics has been used to tackle partial-functions difficulties in abstract data types and programming semantics; see [2,19] for interesting examples of that approach. There exist a numbe... |

8 | G.: A total approach to partial algebraic specification
- Meseguer, Ro¸su
- 2002
(Show Context)
Citation Context ...ith partial-equality troubles is to avoid equality altogether [15,23]. Algebraic semantics has been used to tackle partial-functions difficulties in abstract data types and programming semantics; see =-=[2,19]-=- for interesting examples of that approach. There exist a number of implementations of arithmetic with infinite-precision reals; see [11] for a survey. As far as we can determine, the most advanced an... |

7 |
webpage, http://www.eecs.umich.edu/gasm/, maintained by James K
- Michigan
(Show Context)
Citation Context ...lenbach for information on computable reals. 32 Related Work Exact exploration that we preach here has been practiced by ASM experts for a long time, in various applications in academia and industry =-=[1,7,25]-=-. ASMs, sequential and otherwise, have been used to give high-level operational semantics to programming languages, protocol specifications, etc. In Microsoft, the ASM approach was used to develop Spe... |

5 |
Algorithms: A Quest for Absolute Definitions, Bulletin of European Association for Theoretical
- Blass, Gurevich
- 2003
(Show Context)
Citation Context ... top tool for model-based testing. The axiomatization of algorithms in [13], which is extended here to account for exact exploration, was extended to parallel algorithms and to interactive algorithms =-=[6]-=-. We are aiming for a model of computation that can faithfully support algorithms for which basic operations may have varying costs involved, and/or for which their domains of applicability may be unk... |

4 |
iRRAM, exact arithmetic in C++. http://www.informatik.uni-trier.de/iRRAM
- Müller
(Show Context)
Citation Context ...h infinite-precision reals; see [11] for a survey. As far as we can determine, the most advanced and rapid implementations of exact real number arithmetic today are the iRRAM system of Norbert Müller =-=[22]-=- and the RealLib system by Branimir Lambov [17]. Let us mention also the xrc system (alluding to Exact Reals in C) of Keith Briggs [9] and a Common Lisp package Computable Real Numbers by Michael Stol... |

3 |
Choppy C. Abstract data types with exception handling : an initial approach based on a distinction between exceptions and errors
- Bernot, Bidoit
- 1986
(Show Context)
Citation Context ...ith partial-equality troubles is to avoid equality altogether [15,23]. Algebraic semantics has been used to tackle partial-functions difficulties in abstract data types and programming semantics; see =-=[2,19]-=- for interesting examples of that approach. There exist a number of implementations of arithmetic with infinite-precision reals; see [11] for a survey. As far as we can determine, the most advanced an... |

3 |
Gandy’s Theorem on Abstract Structures without the Equality Test
- Korovina
- 2003
(Show Context)
Citation Context ... have to be a constructivist to be interested in computable mathematical analysis; you may be a recursion theorist [28]. One way to deal with partial-equality troubles is to avoid equality altogether =-=[15,23]-=-. Algebraic semantics has been used to tackle partial-functions difficulties in abstract data types and programming semantics; see [2,19] for interesting examples of that approach. There exist a numbe... |

2 |
Nachum Dershowitz, “The Church-Turing Thesis over arbitrary domains”, Festschrift in Honor of Boris (Boaz
- Boker
- 2007
(Show Context)
Citation Context ...algorithms. “Continuous time” processes await further research. The easing of the requirements on fully-defined equality and other functions also lends strong support to the contention – put forth in =-=[8,10]-=- – that the Church-Turing Thesis is provably true from first principles. In addition to the sequential postulates, the arguments require that initial states contain only free constructors and function... |

2 |
Development http://msdn.microsoft.com/en-us/devlabs/ ee692301.aspx and research http://research.microsoft.com/en-us/projects/ specexplorer/, viewed July 6
- Explorer
- 2010
(Show Context)
Citation Context ...lenbach for information on computable reals. 32 Related Work Exact exploration that we preach here has been practiced by ASM experts for a long time, in various applications in academia and industry =-=[1,7,25]-=-. ASMs, sequential and otherwise, have been used to give high-level operational semantics to programming languages, protocol specifications, etc. In Microsoft, the ASM approach was used to develop Spe... |

2 |
Event structures: Lecture notes for the advanced course on Petri nets
- Winskel
- 1986
(Show Context)
Citation Context ... a Common Lisp package Computable Real Numbers by Michael Stoll [26]. But there are other systems of interest. One of our reviewers suggested that we “ought to engage with” Winskel’s event structures =-=[29]-=- and noted a similarity between our Discrimination requirement in Sect. 5 and Winskel’s coincidence-freeness of configurations. Well, the particular structure of exact exploration can be made to concu... |

1 |
E.: Foundations of Constructive Analyis
- Bishop
- 1967
(Show Context)
Citation Context ...ave varying costs involved, and/or for which their domains of applicability may be unknown or uncomputable. The latter produces an ocean of related work. First, constructive mathematics comes to mind =-=[3,16]-=-. Classical mathematics has no philosophical objections to working with various ideal elements that do not have finite representations. The BSS model of computation with real numbers reflects that att... |

1 | Y.: Algorithms vs. Machines
- Blass, Gurevich
- 2004
(Show Context)
Citation Context ...chovakis has defined an abstract notion of recursor and has proposed that algorithms be identified with recursors; see for example [20,21]. For a discussion of this proposal in the light of ASMs, see =-=[5]-=-. We concentrate here on the aspect of Moschovakis’s proposal connected with the main issue of the present paper, namely “What does an algorithm actually look at?” This issue arises implicitly in [20]... |

1 |
The RealLib Project
- Lambov
(Show Context)
Citation Context ...ey. As far as we can determine, the most advanced and rapid implementations of exact real number arithmetic today are the iRRAM system of Norbert Müller [22] and the RealLib system by Branimir Lambov =-=[17]-=-. Let us mention also the xrc system (alluding to Exact Reals in C) of Keith Briggs [9] and a Common Lisp package Computable Real Numbers by Michael Stoll [26]. But there are other systems of interest... |

1 | Complexity theory via abstract state machines
- Nowack
- 2000
(Show Context)
Citation Context ...ing with various ideal elements that do not have finite representations. The BSS model of computation with real numbers reflects that attitude [4], and ASMs have been used in to emulate the BSS model =-=[24]-=-. On the other hand, constructive mathematics works only with objects that have finite representations. In their world, only computable reals exist, only computable reals-to-reals functions exist, etc... |

1 | Semenov A.L.: Algorithms: Main Ideas and Applications - Uspensky - 1993 |