Abstract
We compare the control structures of Abstract State Machines (in short ASM) defined by Yuri Gurevich and AsmL, a language implementing it. AsmL is not an algorithmically complete language, as opposed to ASM, but it is closer to usual programming languages allowing until and while iterations and sequential composition. We here give a formal definition of AsmL, its semantics, and we construct, for each AsmL program Π, a normal form (which is an ASM program) Π n computing the same function as Π. The number of comparisons and updates during the execution of the normal form is at most three times the number of comparisons and updates in the original program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Grieskamp, W., Tillmann, N.: AsmL Standard Library, Foundations of Software Engineering – Microsoft Research (2002), http://www.codeplex.com/AsmL//AsmLReference.doc , http://research.microsoft.com/en-us/downloads/3444a9cb-47ce-4624-9e14-c2c3a2309a44/default.aspx
Gurevich, Y.: Reconsidering Turing’s Thesis: Toward More Realistic Semantics of Programs, University of Michigan, Technical Report CRL–TR–38–84, EECS Department (1984)
Gurevich, Y.: A New Thesis, Abstracts, p. 317. American Mathematical Society, Providence (August 1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Cégielski, P., Guessarian, I. (2010). Normalization of Some Extended Abstract State Machines. In: Blass, A., Dershowitz, N., Reisig, W. (eds) Fields of Logic and Computation. Lecture Notes in Computer Science, vol 6300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15025-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-15025-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15024-1
Online ISBN: 978-3-642-15025-8
eBook Packages: Computer ScienceComputer Science (R0)