The hidden computation steps of turbo Abstract State Machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2589, Issue , 2003, Pages 244-262

  Fruja, Nicu G ^a   Stärk, Robert F ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

MULTI AGENT SYSTEMS; SEMANTICS;

ABSTRACT STATE MACHINES; BLACK BOXES; COMPUTATION STEPS; MULTI AGENT; RECURSIVE ALGORITHMS; RETURN VALUE; SEQUENTIAL COMPOSITIONS; SYNTACTIC SUGARS;

ABSTRACTING;

EID: 35248867005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36498-6_14     Document Type: Article

References (16)

1. M. Anlauff and P. Kutter. Xasm Open Source. Web pages at http://www.xasm.org/, 2001.
2. A. Blass and Y. Gurevich. Background, reserve, and Gandy machines. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (CSL 2000), pages 1-17. Springer-Verlag, Lecture Notes in Computer Science 1862, 2000.
3. A. Blass and Y. Gurevich. Abstract state machines capture parallel algorithms. ACM Transactions on Computational Logic, 2002. to appear.
4. A. Blass and Y. Gurevich. Algorithms vs. machines. The Logic in Computer Science Column, Bulletin of the European Association for Theoretical Computer Science, 77:96-118, 2002.
5. T. Bolognesi and E. Börger. Abstract State Processes. These Proceedings.
6. E. Börger and T. Bolognesi. Remarks on Turbo ASMs for Functional Equations and Recursion Schemes. These Proceedings.
7. E. Börger and J. Schmid. Composition and submachine concepts. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (CSL 2000), pages 41-60. Springer-Verlag, Lecture Notes in Computer Science 1862, 2000.
8. Foundations of Software Engineering Group, Microsoft Research. AsmL. Web pages at http://research.microsoft.com/foundations/AsmL/, 2001.
9. Y. Gurevich. Evolving algebras 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, pages 9-36. Oxford University Press, 1993.
10. Y. Gurevich. May 1997 draft of the ASM guide. Technical Report CSE-TR-336-97, EECS Dept., University of Michigan, 1997.
11. Y. Gurevich. Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic, 1(1):77-111, 2000.
12. Y. Gurevich and M. Spielmann. Recursive Abstract State Machines. J. of Universal Computer Science, 3(4):233-246, 1997.
13. Y. Moschovakis. What is an algorithm? In B. Engquist and W. Schmid, editors, Mathematics Unlimited - 2001 and beyond (Part II), pages 919-936. Springer-Verlag, 2001.
14. J. Schmid. Executing ASM specifications with AsmGofer. Web pages at http://www.tydo.de/AsmGofer.
15. R.F. Stärk and S. Nanchen. A logic for Abstract State Machines. J. of Universal Computer Science, 7(11):981-1006, 2001.
16. R.F. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine - Definition, Verification, Validation. Springer-Verlag, 2001.