Abstract
In this paper we show how the specifcation and verifcation system PVS (Prototype Verifcation System) can provide tool support for Abstract State Machines (ASMs), especially oriented towards automatic proof checking and mechanized proving of properties. Useful templates are presented which allow encoding of ASM models into PVS without any extra user’s skill. We prove the transformation preserves the ASM semantics and provide a framework for an automatic tool, prototypically implemented, which translates ASM specifcations in PVS. The ASM specifcation of the Production Cell given in [4] is taken as case study to show how to formalize multi-agent ASMs in PVS and prove properties.
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
G. Bella and E. Riccobene. A Realistic Environment for Crypto-Protocol Analyses by ASMs. In Proceedings of the 28th Annual Conference of the German Society of Computer Science. Technical Report, Magdeburg University, 1998.
E. Börger. Why Use Evolving Algebras for Hardware and Software Engineering? In M. Bartosek, J. Staudek, and J. Wiederman, editors, Proceedings of SOFSEM’95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, volume 1012 of LNCS, pages 236–271. Springer, 1995.
E. Börger. High level system design and analysis using abstract state machines. In D. Hutter, W. Stephan, P. Traverso, and M. Ullmann, editors, Current Trends in Applied Formal Methods (FM-Trends 98), number 1641 in LNCS, pages 1–43. Springer-Verlag, 1999.
E. Börger and L. Mearelli. Integrating ASMs into the Software Development Life Cycle. Journal of Universal Computer Science, 3(5):603–665, 1997.
G.Del Castillo. The ASM Workbench: an Open and Extensible Tool Environment for Abstract State Machines. In Proceedings of the 28th Annual Conference of the German Society of Computer Science. Technical Report, Magdeburg University, 1998.
G. Del Castillo and K. Winter. Model Checking Support for the ASM High-Level Language. Technical Report TR-RI-99-209, Universität-GH Paderborn, June 1999.
A. Dold, T. Gaul, V. Vialard, and W. Zimmerman. ASM-Based Mechanized Verification of Compiler Back-Ends. In Proceedings of the 28th Annual Conference of the German Society of Computer Science. Technical Report, Magdeburg University, 1998.
Axel Dold. A formal representation of abstract state machines using pvs. Technical Report Verifix Report Ulm/6.2, Universitat Ulm, July 1998.
Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, pages 9–36. Oxford University Press, 1995.
C. Heitmeyer. On the Need for Parctical Formal Methods. In Proceedings of FTRTFT’98, 5th Intern. Symposium Real-Time Fault-Tolerant Systems, volume 1486 of LNCS, pages 18–26. Springer, 1998.
C. Lewerentz and T. Linder, editors. Formal Development of Reactive Systems. A Case Study “Production Cell”. Number 891 in LNCS. Springer, 1995.
G. Schellhorn and W. Ahrendt. Reasoning about Abstract State Machines: The WAM Case Study. Journal of Universal Computer Science, 3(4):377–413, 1997.
N. Shankar, S. Owre, and J. Rushby. The PVS proof checker: A reference manual. Technical report, Computer Science Lab., SRI Intl., Menlo Park, CA, 1993.
K. Winter. Model Checking for Abstract State Machines. Journal of Universal Computer Science, 3(5):689–701, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gargantini, A., Riccobene, E. (2000). Encoding Abstract State Machines in PVS. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds) Abstract State Machines - Theory and Applications. ASM 2000. Lecture Notes in Computer Science, vol 1912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44518-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-44518-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67959-2
Online ISBN: 978-3-540-44518-0
eBook Packages: Springer Book Archive