Abstract state machines and their applications
DOI:
https://doi.org/10.26507/rei.v7n13.160Keywords:
evolving algebras, finite automata, abstract state machines, finite state machines, Turing machinesAbstract
This paper aims to summarize the origin of the Abstract State Machine (ASM) and on the basis of its particular features proposes a formal definition. As well, it exposes the relationships between ASM and Pushdown Automaton (PA) emphasis on the fundamentals. Eventually presents a general application of the ASM in Data Base field, taking into account three remarkable works show in the official ASM web site.
Downloads
References
Blass, A., Guverich, Y., & Brussche, J. (2002). Abstract state machines and computationally complete query langages. Information and Computation, 174(1), 20-36.
Börger, E. (2004). Modeling with abstract state machines: a support for accurate system desing and analysis. Lecture Notes in Informatics, 235–239.
Börger Egon, & Stärk Robert. (2003). Abstract state machines. Springer-Verlag, Berlin Heidelberg.
Dershowitz, N. (2010). Abstract state machines: a generic model of computation, (i), 1-12.
Flake, S., & Mueller, W. (2004). An ASM definition of the dynamic OCL 2 . 0 semantics. Lecture Notes in Computer Science, 3273, 226-240.
Fordham, B., Abiteboul, S., & Yesha, Y. (1997). Evolving databases: an application to electronic commerce. Proceedings of the 1997 International Database Engineering and Applications Symposium (Cat. No.97TB100166), IEEE Computer Society.
Gayo, J. E. L., Lovelle, J. M. C., Díez, M. C. L., Río, C. del, & Joyanes Aguilar, L. (2001). Comparación de técnicas de especificación semántica de lenguajes de programación. Simposio Iberoamericano de Sistemas de Información e Ingeniería del software en la Sociedad del Conocimiento.
Gottlob, G., Kappel, G., & Schrefl, M. (1991). Semantics of object-oriented data models - the evolving algebra approach. Lecture Notes in Computer Science, 504, 144-160.
Gurevich, Y. (2000). Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic, 1(212), 1-32.
Gurevich, Y., & Börger, E. (1995). Evolving algebras. Denmark: Department of Computer Science, University of Aarhus.
Gurevich, Y., & Rosenzweig, D. (2000). Partially ordered runs : a case study. ASM ’00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications.
Gurevich, Y., Soparkar, N., & Wallace, C. (1997). Formalizing database recovery. Journal of Universal Computer Science, 3(4), 320-340.
Gurevich, Y., Veanes, M., & Wallace, C. (2006). Can abstract state machines be useful in languaje theory? Theorical Computer Science. 376(1-2), 17-29.
Lee, D., & Yannakakis, M. (1996). Principles and methods of testing finite state machines-a survey. IEEE Transactions on Software Engineering, 84(8), 1090-1123.
Patnaik, G. K., & Gore, M. M. (2002). Design of compiler for mobile environment and its formalization using evolving algebra. Proceedings Third International Conference on Mobile Data Management MDM 2002, IEEE Computer Society.
Prinz, A., & Thalheim, B. (2003). Operational semantics of transactions. Conferences in Research and Practice in Information Tecnology, 17, 169-179.
Razali, R., & Garratt, P. (2010). Usability requirements of formal verification tools: a survey. Jorunal of Computer Science, 6(10), 1189-1198.
Sinha, R., & Patel, H. D. (2011). Abstract state machines as an intermediate representation for high-level synthesis. Design, Automation & Test in Europe Conference & Exhibition (DATE).
URL 1 : http://www.eecs.umich.edu/gasm/intro.html, Recuperado el 25 de Mayo de 2012. Página oficial de las ASM.
Downloads
Published
How to Cite
Issue
Section
License
Total or partial reproduction of the documents published in the journal is authorized only when the source and author are cited.
| Article metrics | |
|---|---|
| Abstract views | |
| Galley vies | |
| PDF Views | |
| HTML views | |
| Other views | |
