العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
EspañolABSTRACT STATE MACHINES
(Redirected from Abstract State Machines)
'Abstract State Machines' (ASM), formerly known as ''Evolving Algebras'', are a formal method for specification and verification. In computer science, the term 'abstract state machine' is used as a synonym for a finite state machine with regard to abstract algorithms for sorting.
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.
★ 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)
★ Abstract State Machines
★ Workshops on Abstract State Machines
★ Homepage of the XASM open source project
★ CoreASM, an extensible ASM execution engine
★ TASM, The Timed Abstract State Machine Language and Toolset
★ ASMETA, the the Abstract State Machine Metamodel and its tool set
'Abstract State Machines' (ASM), formerly known as ''Evolving Algebras'', are a formal method for specification and verification. In computer science, the term 'abstract state machine' is used as a synonym for a finite state machine with regard to abstract algorithms for sorting.
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.
| Contents |
| References |
| External links |
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)
External links
★ Abstract State Machines
★ Workshops on Abstract State Machines
★ Homepage of the XASM open source project
★ CoreASM, an extensible ASM execution engine
★ TASM, The Timed Abstract State Machine Language and Toolset
★ ASMETA, the the Abstract State Machine Metamodel and its tool set
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves
