Interactive small-step algorithms I: Axiomatization

Logical Methods in Computer Science

Volumn 3, Issue 4, 2007, Pages

  Blass, Andreas ^a   Gurevich, Yuri ^b   Rosenzweig, Dean ^c   Rossman, Benjamin ^d  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF ZAGREB   (Croatia)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Abstract state machine; Abstract state machine thesis; Behavioral equivalence; Interactive algorithm; Ordinary algorithms; Query; Small step algorithm

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ABSTRACT STATE MACHINES; BEHAVIORAL EQUIVALENCE; INTERACTIVE ALGORITHMS; QUERY; STEP ALGORITHMS;

EQUIVALENCE CLASSES;

EID: 84974655620     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(4:3)2007     Document Type: Article

References (35)

1. Alfred Aho, John Hopcroft, and Jeffrey Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).
2. ASM Michigan webpage, http://www.eecs.umich.edu/gasm/, maintained by James K. Huggins.
3. The AsmL webpage, http://research.microsoft.com/foundations/AsmL/.
4. Nick Benton, Luca Cardelli and Cédric Fournet, “Modern Concurrency Abstractions for C#,” in Proceedings of the 16th European Conference on Object-Oriented Programming (ECOOP 2002). June 10-14, 2002 University of Málaga, Spain, B. Magnusson, ed., Springer-Verlag, Lecture Notes in Computer Science 2374.
5. Andreas Blass and Yuri Gurevich, “Abstract state machines capture parallel algorithms,” ACM Trans. Computational Logic, 4 (2003) 578-651.
6. Andreas Blass and Yuri Gurevich, “Algorithms: A quest for absolute definitions,” Bull. Europ. Assoc. Theoret. Comp. Sci. 81 (2003) 195-225.
7. Andreas Blass and Yuri Gurevich, “Ordinary Interactive Small-Step Algorithms, I,” ACM Trans. Computational Logic 7 (2), 363-419.
8. Andreas Blass and Yuri Gurevich, “Ordinary Interactive Small-Step Algorithms, II,” ACM Trans. Computational Logic, to appear.
9. Andreas Blass and Yuri Gurevich, “Ordinary Interactive Small-Step Algorithms, III,” ACM Trans. Computational Logic, to appear.
10. Andreas Blass, Yuri Gurevich, Dean Rosenzweig, and Benjamin Rossman, “Interactive small-step algorithms II: Abstract state machines and the characterization theorem” (tentative title), in preparation.
11. Andreas Blass, Yuri Gurevich, Dean Rosenzweig, and Benjamin Rossman, “Composite interactive algorithms” (tentative title), in preparation.
12. Andreas Blass, Yuri Gurevich, and Saharon Shelah, “On polynomial time computation over unordered structures,” J. Symbolic Logic 67 (2002) 1093-1125.
13. Egon Börger and Robert Stärk, “Abstract State Machines: A Method for High-Level System Design and Analysis”, Springer-Verlag, 2003.
14. Alonzo Church, “An unsolvable problem of elementary number theory”, American Journal of Mathematics 58 (1936), 345-363. Reprinted in [15, 88-107].
15. Martin Davis, “The Undecidable”, Raven Press, 1965.
16. Andreas Glausch, Varianten des ASM-Theorems, Diploma thesis, Humboldt University, Berlin (2005).
17. Andreas Glausch and Wolfgang Reisig, “Distributed abstract state machines and their expressive power,” preprint (2005).
18. Dina Q. Goldin, Scott A. Smolka, Paul C. Attie, Elaine L. Sonderegger, “Turing Machines, Transition Systems, and Interaction”, Information and Computation 194:2 (2004), 101-128.
19. Dina Goldin, Scott Smolka and Peter Wegner, editors, Interactive Computation: The New Paradigm, Springer, 2006.
20. Yuri Gurevich, “A new thesis,” Abstract 85T-68-203, Amer. Math. Soc. Abstracts 6 (August, 1985), page 317.
21. Yuri Gurevich, “Evolving Algebras: An Introductory Tutorial”, Bull. EATCS 43 (Feb. 1991), 264-284. Reprinted with slight revisions in Current Trends in Theoretical Computer Science: Essays and Tutorials, eds. G. Rozenberg and A. Salomaa World Scientific, 1993, 223-394.
22. Yuri Gurevich, “Evolving algebra 1993: Lipari guide,” in Specification and Validation Methods, E. Börger, ed., Oxford Univ. Press (1995) 9-36.
23. Yuri Gurevich, “Sequential abstract state machines capture sequential algorithms,” ACM Trans. Computational Logic 1 (2000) 77-111.
24. Yuri Gurevich, “Interactive Algorithms 2005 with Added Appendix”, in [19].
25. Stephen Cole Kleene, Introduction to Metamathematics, Van Nostrand, 1952.
26. Andrei N. Kolmogorov, “On the concept of algorithm”, Uspekhi Mat. Nauk 8:4 (1953), 175-176, Russian. An English translation is found in [35, pages 18-19].
27. Andrei N. Kolmogorov and Vladimir A. Uspensky, “On the definition of algorithm”, Uspekhi Mat. Nauk 13:4 (1958), 3-28, Russian; translated into English in AMS Translations 29 (1963), 217-245.
28. Nancy L. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, 1996.
29. Udi Manber, Introduction to Algorithms: A Creative Approach, Addison-Wesley (1989).
30. Yiannis N. Moschovakis, “What is an algorithm?” in B. Engquist andW. Schmid, Editors, Mathematics Unlimited, Springer-Verlag (2001) 919-936.
31. David S. Platt, Introducing Microsoft.NET, Microsoft Press 2003.
32. Kay Robbins and Steve Robbins, Unix Systems Programming: Communication, Concurrency and Threads, Prentice Hall Professional Technical Reference, 2003.
33. Davide Sangiorgi and David Walker, The Pi-calculus: a Theory of Mobile Processes, Cambridge University Press, 2001.
34. Alan M. Turing, “On computable numbers, with an application to the Entscheidungsproblem”, Proceedings of the London Mathematical Society, series 2, vol. 42 (1936-1937), 230-265; correction, ibidem, vol. 43, 544-546. Reprinted in [15, 155-222] and available online at http://www.abelard.org/turpap2/tp2 − ie.asp.
35. Vladimir A. Uspensky and Alexei L. Semenov, Algorithms: Main Ideas and Applications, Kluwer, 1993.