Abstract
Gurevich’s Abstract State Machines (ASM) constitute a high-level specification language for a wide range of applications. The existing tool support for ASM was extended, in a previous work, to provide computer-aided verification, in particular by model checking. In this paper, we discuss the applicability of the model checking approach in general and describe the steps that are necessary tofit different kinds of ASM models for the model checking process. Along the example of the FLASH cache coherence protocol, we show how model checking can support development and debugging of ASM models. We show the necessary refinement for the message passing behaviour in the protocol and give examples for errors found by model checking the resulting model. We conclude with some general remarks on the existing transformation algorithm.
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
E. Börger, Y. Gurevich, and D. Rosenzweig. The Bakery Algorithm: Yet Another Specification and Verification. In E. Börger, editor, Specification and Validation Methods. Oxford University Press, 1994.
G. Del Castillo and K. Winter. Model checking support for the ASM high-level language. In S. Graf and M. Schwartzbach, editors, Proc. on 6th Int. Conf. TACAS 2000, volume 1785 of LNCS, pages 331–346, 2000.
A. Durand. Modeling cache coherence protocol-a case study with FLASH. In U. Glässer and P. Schmitt, editors, Procs. of the 28th Conf. of German Society of Computer Science, TR, Magdeburg University, 1998.
T. Filkorn et al. SVE Users’ Guide. Siemens AG, München, 1996.
The VIS Group. Vis: A system for verification and synthesis. In T. Henzinger, R. Alur, editor, 8th Int. Conf. CAV’96, volume 1102 of LNCS, 1996.
J. Kuskin, D. Ofelt, and M. Heinrich et. al. The stanford FLASH multiprocessor. In 21th Int. Symp. on Computer Architecture, 1994.
K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
L. Mearelli. An Evolving Algebra Model Of The Production Cell. Master’s thesis, Universita di Pisa, 1996.
S. Park and D. Dill. Verification of cache coherence protocols by aggregatiuon of distributed transactions. Theory of Computing Systems, 31:355-376, 1998.
M. Spielmann. Model Checking Abstract State Machines and Beyond. In This Volume.
M. Spielmann. Automatic verification of abstract state machines. In N. Halbwachs and D. Peled, editors, Computer Aided Verification, CAV’ 99, number 1633 in LNCS, pages 431–442, Trento, Italy, 1999.
J. M. Wing and M. Vaziri-Farahani. A case study in model checking software systems. Science of Computer Programming, 28:273–299, 1997.
K. Winter. Model checking for abstract state machines. J.UCS Journal for Universal Computer Science (special issue), 3(5):689–702, 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
Winter, K. (2000). Towards a Methodology for Model Checking ASM: Lessons Learned from the FLASH Case Study. 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_19
Download citation
DOI: https://doi.org/10.1007/3-540-44518-8_19
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