Can abstract state machines be useful in language theory?

Theoretical Computer Science

Volumn 376, Issue 1-2, 2007, Pages 17-29

  Gurevich, Yuri ^a   Veanes, Margus ^a   Wallace, Charles ^b  

^a MICROSOFT RESEARCH   (United States)

^b MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

Author keywords

Abstract state machine; AsmL; Evolutionary algorithms; Graph partition algorithm; Language theory

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; SEMANTICS; SPECIFICATION LANGUAGES;

ABSTRACT STATE MACHINE (ASM); GRAPH PARTITION ALGORITHMS; LANGUAGE THEORY;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 34147190198     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.01.009     Document Type: Article

References (23)

1. Abstract State Machines. http://www.eecs.umich.edu/groups/gasm/
2. Abstract State Machine Language (AsmL). http://research.microsoft.com/fse/asml/
3. Thomas Bäck, Introduction to evolutionary algorithms, in [4], pp. 59-63
4. Bäck T., Fogel D.B., and Michaelewicz Z. Evolutionary Computation 1: Basic Algorithms and Operators (2000), Institute of Physics Publishing
5. Blass A., and Gurevich Y. Algorithms: A quest for absolute definitions. Bulletin of the European Association for Theoretical Computer Science 81 (2003) 195-225 Reprinted in Current Trends in Theoretical Computer Science, World Scientific (2004) 283-311, and in Church's Thesis After 70 Years, Ontos Verlag (2006) 24-57
6. Blass A., and Gurevich Y. Parallel abstract state machines capture parallel algorithms. ACM Transactions on Computational Logic 4 4 (2003) 578-651
7. Blass A., Gurevich Y., and Shelah S. Choiceless polynomial time. Annals of Pure and Applied Logic 100 (1999) 141-187
8. Blass A., Gurevich Y., and Shelah S. On polynomial time computation over unordered structures. Journal of Symbolic Logic 67 3 (2002) 1093-1125
9. Börger E. Abstract state machines: A unifying view of models of computation and of system design frameworks. Annals of Pure and Applied Logic 133 (2005) 149-171
10. Corneil D.G., and Gotlieb C.C. An efficient algorithm for graph isomorphism. Journal of ACM 17 1 (1970) 51-64
11. Cordella L.P., Foggia P., Sansone C., and Vento M. A (sub)graph isomorphism algorithm of matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 1367-1372
12. DLT 2006 website, http://dlt2006.cs.ucsb.edu/
13. Grädel E., and Nowack A. Quantum computing and abstract state machines. In: Börger E. (Ed). Abstract State Machines: Advances in Theory and Applications. Lecture Notes in Computer Science vol. 2589 (2003), Springer-Verlag 309-323
14. Gurevich Y. Evolving algebras 1993: Lipari guide. In: Börger E. (Ed). Specification and Validation Methods (1995), Oxford University Press 9-36
15. Gurevich Y. Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1 1 (2000) 77-111
16. Gurevich Y. Interactive algorithms 2005 with added appendix. In: Goldin D., Smolka S.A., and Wegner P. (Eds). Interactive Computation: The New Paradigm (2006), Springer 165-182
17. Gurevich Y., Rossman B., and Schulte W. Semantic essence of AsmL. Theoretical Computer Science 343 3 (2005) 370-412
18. Kozen D.C. Automata and Computability (1997), Springer
19. Mariusz Nowostawski, Riccardo Poli, Parallel genetic algorithm taxonomy, in: Proc. Third International Conference on Knowledge-based Intelligent Information Engineering Systems, KES, 1999, pp. 88-92
20. In: Rozenberg G. (Ed). Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1 - Foundations (1997), World Scientific
21. Spec Explorer. http://research.microsoft.com/specexplorer/
22. Turing A. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of London Mathematical Society (Series 2) 42 (1936-1937) 230-265
23. Turing A. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of London Mathematical Society (Series 2) 43 (1936-1937) 544-546 (Correction)