Abstract
The SPIN extension presented in this article is meant as a way to facilitate the modeling and verification of object-oriented programs. It provides means for the formal representation of some run-time mechanisms intensively used in OO software, such as dynamic object creation and deletion, virtual function calls, etc. This article presents a number of language extensions along with their implementation in SPIN. We carried out a number of experiments and found out that an important expressibility gain can be achieved with at most a small loss of performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman: Compilers, Principles, Techniques and Tools. Addison-Wesley (1986)
R. Bayer and M. Schkolnick: Concurrency of Operations on B-Trees. Acta Informatica, Vol. 9. Springer-Verlag (1977) 1–21
Thierry Cattel:Modeling and Verification of sC++ Applications. Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal, LNCS 1384. Springer-Verlag (April 1998) 232–248
C. Demartini, R. Iosif, and R. Sisto: Modeling and Validation of Java Multithreading Applications using SPIN, Proceedings of the 4th workshop on automata theoretic verification with the SPIN model checker, Paris, France (November 1998) 5–19
R. Iosif: The dSPIN User Manual. http://www.dai-arc.polito.it/dai-arc/auto/tools/tool7.shtml
Gerard J. Holzmann: State Compression in SPIN: Recursive Indexing and Compression Training Runs. Proceedings of the 3rd workshop on automata theoretic verification with the SPIN model checker, Twente, Holland (April 1997)
Gerard J. Holzmann: An Improvement in Formal Verification. Proceedings FORTE 1994 Conference, Bern, Switzerland (October 1994)
Knuth, D.E.:The Art of Computer Programming. Vol. 3. Sorting and Searching. Addison-Wesley (1972)
Bjarne Stroustrup: The C++ Programming Language. Addison-Wesley (1991)
Pierre Wolper and Patrice Godefroid: Partial-Order Methods for Temporal Verification. CONCUR’ 93 Proceedings, Lecture Notes in Computer Science, Vol. 715. Springer-Verlag (August 1993) 233–246
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
Demartini, C., Iosif, R., Sisto, R. (1999). dSPIN: A Dynamic Extension of SPIN. In: Dams, D., Gerth, R., Leue, S., Massink, M. (eds) Theoretical and Practical Aspects of SPIN Model Checking. SPIN 1999. Lecture Notes in Computer Science, vol 1680. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48234-2_20
Download citation
DOI: https://doi.org/10.1007/3-540-48234-2_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66499-4
Online ISBN: 978-3-540-48234-5
eBook Packages: Springer Book Archive