Abstract
As a framework for the systematic development of tools supporting the development and analysis of Abstract State Machine (ASM) specifications, we developed the ASM Workbench. This paper describes the basic concepts of its architecture and the existing components.
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
M. Anlauff. Asian: Programming in Abstract State Machines (draft of the language specification). Available at http://www.first.gmd.de/~ma/projects.htm, 1998.
M. Anlauff, P. Kutter, and A. Pierantonio. Formal Aspects of and Development Environments for Montages. In M. Selh’nk, editor, 2nd International Workshop on the Theory and Practice of Algebraic Specifications, Workshops in Computing, Amsterdam, 1997. Springer.
B. Beckert and J. Posegga. leanEA: A Lean Evolving Algebra Compiler. In H. Kleine Büning, editor, Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL’95), volume 1092 of LNCS, pages 64–85. Springer, 1996.
G. Del Castillo. ASM-SL, a Specification Language based on Gurevich’s Abstract State Machines: Introduction and Tutorial. Technical report (to appear), Universität-GH Paderborn, 1999.
L. Damas and R. Milner. Principal type schemes for functional programs. In Proceedings of the 9th ACM Symposium on Principles of Programming Languages, pages 207–212, 1982.
D. Diesen. Specifying Algorithms Using Evolving Algebra. Implementation of Functional Programming Languages. Dr. scient. degree thesis, Dept. of Informatics, University of Oslo, Norway, March 1995.
D. Diesen, T.O. Svendsen, and B. Thorstensen. Developing new ASM tools. In U. Glässer and P.H. Schmitt, editors, Proceedings of the Fifth International Workshop on Abstract State Machines, pages 155–158, Magdeburg, Germany, September 1998.
I. Durdanovic. From Operational Specifications to Real Architectures (work in progress). PhD thesis, Universität-GH Paderborn, to appear in 1999.
FALKO—Fahrplanvalidierung und Konstruktion in Nahverkehrssystemen. Siemens München, ZT SE 4.
Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, pages 9–36. Oxford University Press, 1995.
Y. Gurevich and J. Huggins. Evolving Algebras and Partial Evaluation. In B. Pehrson and I. Simon, editors, IFIP 13th World Computer Congress, volume I: Technology/Foundations, pages 587–592, Elsevier, Amsterdam, the Netherlands, 1994.
J. Huggins and R. Mani. The Evolving Algebra Interpreter Version 2.0. Documentation of the Michigan Evolving Algebra Interpreter, available electronically at ftp://ftp.eecs.umich.edu/groups/Ealgebras/interp2.tar.Z.
C.B. Jones. Systematic Software Development using VDM. Prentice Hall, 1990.
A.M. Kappel. Executable Specifications Based on Dynamic Algebras. In A. Voronkov, editor, Logic Programming and Automated Reasoning, volume 698 of Lecture Notes in Artificial Intelligence, pages 229–240. Springer, 1993.
K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1997.
R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990.
S. Owre, J. M. Rushby, and N. Shankar. PVS: A Prototype Verification System. In Deepak Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction (CADE), volume 607 of Lecture Notes in Computer Science, pages 748–752. Springer-Verlag, 1992.
W. Reif, G. Schellhorn, K. Stenzel, and M. Balser. Structured specifications and interactive proofs with KIV. In W. Bibel and P. Schmitt, editors, Automated Deduction—A Basis for Applications. Kluwer Academic Publishers, 1998.
G. Schellhorn and W. Ahrendt. Reasoning about Abstract State Machines: The WAM Case Study. Journal of Universal Computer Science, 3(4):377–413, 1997.
K. Winter. Model Checking for Abstract State Machines. Journal of Universal Computer Science, 3(5):689–701, 1997.
W. Zimmerman and T. Gaul. On the Construction of Correct Compiler Back-Ends: An ASM Approach. Journal of Universal Computer Science, 3(5):504–567, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Del Castillo, G. (1999). Towards Comprehensive Tool Support for Abstract State Machines: The ASM Workbench Tool Environment and Architecture. In: Hutter, D., Stephan, W., Traverso, P., Ullmann, M. (eds) Applied Formal Methods — FM-Trends 98. FM-Trends 1998. Lecture Notes in Computer Science, vol 1641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48257-1_21
Download citation
DOI: https://doi.org/10.1007/3-540-48257-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66462-8
Online ISBN: 978-3-540-48257-4
eBook Packages: Springer Book Archive