Abstract State Machines

From Wikipedia, the free encyclopedia

It has been suggested that this article or section be merged with abstract state machine. (Discuss)

Abstract State Machines (ASM), formerly known as Evolving Algebras, are a formal method for specification and verification. The approach was originally developed by Yuri Gurevich, based around the concept of an abstract state machine, and is also espoused by Egon Börger. ASM theory is the basis for Abstract State Machine Language by Microsoft and XASM (Anlauff's eXtensible ASMs), an open source implementation. A number of support tools are available.

[edit] References

• Y. Gurevich, P. Kutter, M. Odersky and L. Thiele (eds.), Abstract State Machines: Theory and Applications, Lecture Notes in Computer Science, volume 1912, Springer-Verlag, 2000. (ISBN 3-540-67959-6)
• E. Börger and R. Stärk, Abstract State Machines: A Method for High-Level System Design and Analysis, Springer-Verlag, 2003. (ISBN 3-540-00702-4)

[edit] External links

• Abstract State Machines
• Workshops on Abstract State Machines
• Homepage of the XASM open source project
• CoreASM, an extensible ASM execution engine

 This computer science-related article is a stub. You can help Wikipedia by expanding it.