Abstract State Machines Capture Parallel Algorithms

ACM Transactions on Computational Logic

Volumn 4, Issue 4, 2003, Pages 578-651

  Blass, Andreas ^a   Gurevich, Yuri ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

abstract state machine; Algorithms; ASM thesis; Languages; Parallel algorithm; postulates for parallel computation; Theory

Indexed keywords

ABSTRACT STATE MACHINE (ASM); ASM THESIS; POSTULATES FOR PARALLEL COMPUTATION;

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PARAMETER ESTIMATION;

PARALLEL ALGORITHMS;

EID: 3042773722     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/937555.937561     Document Type: Article

References (14)

1. Blass, A. and Gurevich, Y. 2000. The Logic of Choice. J. Symbolic Logic 65, 3 (September), 12641310.
2. Blass, A., Gurevich, Y., and Shelah, S. 1999. Choiceless Polynomial Time. Annals of Pure and Applied Logic 100, 141-187.
3. Borger, E. and Schmid, J. 2000. Composition and Submachine Concepts for Sequential ASMS. In Computer Science Logic (Proceedings ofCSL 2000), P. Clote and H. Schwichtenberg, Eds. LNCS, vol. 1862. Springer-Verlag, 41-60.
4. Dawar, A. and Gurevich, Y. 2001. Fixed Point Logics. Bull. Symbolic Logic 8.
5. Gradel, E. and Gurevich, Y. 1998. Metafinite Model Theory. Information and Computation 140, 1 (10 January), 26-81.
6. Gradel, E. and Nowack, A. 2003. Quantum Computing and Abstract State Machines. In Abstract State Machines-Advances in Theory and Applications, vol. 2589 of LNCS, Springer-Verlag, 309-332.
7. Gurevich, Y. 1995. Evolving Algebras 1993: Lipari Guide. In Specification and Validation Methods, E. Borger, Ed. Oxford University Press, 9-36.
8. Gurevich, Y. 1997. May 1997 Draft of the ASM Guide. Tech. Rep. CSE-TR-336-97, University of Michigan.
9. Gurevich, Y. 2000. Sequential Abstract State Machines Capture Sequential Algorithms. ACM Trans. Computational Logic 1, 1 (July), 77-111.
10. Gurevich, Y., Schulte, W., and Veanes, M. 2001. Rich Sequential-Time ASMs. In Formal Methods and Tools for Computer Science (Proceedings of Eurocast 2001), R. Moreno-Diaz and A. Quesada-Arencibia, Eds. Universidad de Las Palmas de Gran Canaria, Canary Islands, Spain, 291-293.
11. Gurevich, Y. and Spielmann, M. 1997. Recursive Abstract State Machines. J. Univ. Comput. Sci. 3, 4, 233-246.
12. Gurevich, Y. and Tillman, N. 2001. Partial Updates: Exploration. J. Univ. Comput. Sci. 7, 918952.
13. Karp, R. M. and Ramachandran, V. 1990. Parallel Algorithms for Shared-Memory Machines. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. A. Elsevier and M.I.T. Press, 869-941.
14. Lamport, L. 1997. Processes are in the Eye of the Beholder. Theoret. Comp. Sci. 179, 333-351.