Abstract State Machines (hencefort referred to as just ASM) were introduced as ^a€oea computation model that is more powerful and more universal than standard computation models"i¿½? by Yuri Gurevich in 1985. Here we provide some intuitive and motivating arguments, and characteristic examples for (the elementary version of) ASM. The intuition of ASM as a formal framework for ^a€oepseudocode"i¿½? algorithms is highlighted. Generalizing variants of the fundamental ^a€oesequential small-step"i¿½? version of ASM are also considered.
%0 Book Section
%1 reisig_08_abstract
%A Reisig, Wolfgang
%D 2008
%J Logics of Specification Languages
%K _to_download_springer classroom 2007 asm
%P 15--46
%R 10.1007/978-3-540-74107-7_2
%T Abstract State Machines for the Classroom
%U http://dx.doi.org/10.1007/978-3-540-74107-7_2
%X Abstract State Machines (hencefort referred to as just ASM) were introduced as ^a€oea computation model that is more powerful and more universal than standard computation models"i¿½? by Yuri Gurevich in 1985. Here we provide some intuitive and motivating arguments, and characteristic examples for (the elementary version of) ASM. The intuition of ASM as a formal framework for ^a€oepseudocode"i¿½? algorithms is highlighted. Generalizing variants of the fundamental ^a€oesequential small-step"i¿½? version of ASM are also considered.
@incollection{reisig_08_abstract,
abstract = {Abstract State Machines (hencefort referred to as just ASM) were introduced as ^{a}€{oe}a computation model that is more powerful and more universal than standard computation models"{i}¿½? by Yuri Gurevich in 1985. Here we provide some intuitive and motivating arguments, and characteristic examples for (the elementary version of) ASM. The intuition of ASM as a formal framework for ^{a}€{oe}pseudocode"{i}¿½? algorithms is highlighted. Generalizing variants of the fundamental ^{a}€{oe}sequential small-step"{i}¿½? version of ASM are also considered.},
added-at = {2009-02-11T20:43:45.000+0100},
author = {Reisig, Wolfgang},
biburl = {https://www.bibsonomy.org/bibtex/2df7cff9506569cc187aed1cd8989507b/leonardo},
citeulike-article-id = {2072462},
doi = {10.1007/978-3-540-74107-7_2},
interhash = {4ef6496661e61c611ba46de389be4b37},
intrahash = {df7cff9506569cc187aed1cd8989507b},
journal = {Logics of Specification Languages},
keywords = {_to_download_springer classroom 2007 asm},
pages = {15--46},
posted-at = {2007-12-07 10:53:07},
priority = {4},
timestamp = {2009-02-11T20:43:45.000+0100},
title = {Abstract State Machines for the Classroom},
url = {http://dx.doi.org/10.1007/978-3-540-74107-7_2},
year = 2008
}