Abstract
Model Checking is a powerful verification method to increase the quality of software systems. However, the application of this technique is only possible and fruitful if useful models of the software are available. A useful model is an abstract representation of a system, containing only the details necessary to ensure that satisfaction (non-satisfaction) of interesting properties in the model provides information about the behavior of the real system. Abstraction methods have become one of the hottest topics in the automatic verification of software systems because they can reduce the state space to be explored and allow the verification of more complex systems [1],[3].
This research is partially supported by the European Commission and CICYT under projects TIC99-1083-C02-01 and TAP-1FD97-1269-C02-02.
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. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. ACM Trans. on Programming Languages and Systems, 16(5):1512–1245, 1994.
M. Dwyer, J. Hatcliff, R. Joehanes, S. Laubach, C. Pasareau, W. Visser, H. Zheng. Tool-supported Program Abstraction for Finite-state Verification. Proc. Int. Conf. on Software Engineering, ICSE 2001, 2001.
D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253–291, 1997.
M.M. Gallardo and P. Merino. A framework for automatic construction of abstract promela models. Theoretical and Practical Aspects of spin Model Checking, LNCS-1680:184–199, 1999.
M.M. Gallardo and P. Merino. A practical method to integrate abstractions into SDL and MSC based tools. In Proc. of the 5th Int. ERCIM Workshop on Formal Methods for Industrial Critical Systems, GMD Report 91, pages 84–89, 2000.
M.M. Gallardo, J. Martinez, P. Merino and E. Rosales, Using XML to implement Abstraction for Model Checking. In Proc. of ACM Symposium on Applied Computing, 2002.
M.M. Gallardo, P. Merino, and E. Pimentel. Abstract satisfiability of linear temporal logic. In Proc. of I Jornadas sobre Programacion y Lenguajes, pages 163–178, 2001.
M.M. Gallardo, J. Martinez, P. Merino and E. Pimentel. αspin project. University of Málaga. http://www.lcc.uma.es/~gisum/fmse/tools.
Havelund K., Pressburger T., Model Checking Java Programs using Java Path Finder. Software Tools for Technology Transfer (STTT) 2(4):366–381, 2000.
G. J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):279–295, 1997.
G. J. Holzmann and M. H. Smith. A Practical Method for the Verification of Event Driven Systems. In Proc. Int. Conf. on Software Engineering, ICSE99, pages 597–608, 1999.
W3Consortium. Extensible Markup Language (XML) 1.0 (Second Edition), http://www.w3.org/XML/, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
del Mar Gallardo, M., Martínez, J., Merino, P., Pimentel, E. (2002). αSPIN: Extending SPIN with Abstraction. In: Bošnački, D., Leue, S. (eds) Model Checking Software. SPIN 2002. Lecture Notes in Computer Science, vol 2318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46017-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-46017-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43477-1
Online ISBN: 978-3-540-46017-6
eBook Packages: Springer Book Archive