Abstract
This introductory paper has been written for readers who know nothing about model checking but do know about software. Its aim is to present, almost without mathematical terms, the fundamental general approaches on which the papers in this Special Section build, and give an idea of what kind of contribution each paper makes. The main issues discussed are motivation for model checking, state spaces, and bounded model checking with sat solvers. Individual papers lead to discuss the following ideas: exploiting a distributed computing environment for model checking, constructing those states first that look most promising for eventually finding errors, only constructing a representative subset of states, the representation of contents of variables in an abstract way with approximation from below, and the use of more general solvers than sat solvers in bounded model checking.
Similar content being viewed by others
References
Baier C., Katoen J.-P.: Principles of Model Checking, pp. 975. MIT Press, Cambridge (2008)
Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Highly Dependable Software, Advances in Computers, vol. 58, pp. 118–149. Elsevier, Amsterdam (2003)
Clarke E.M., Grumberg O., Peled D.A.: Model Checking, pp. 314. MIT Press, Cambridge (1999)
Cook, S.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Kleine Büning, H., Zhao, X. (eds): Theory and Applications of Satisfiability Testing—SAT 2008. 11th International Conference, Guangzhou, China, 12–15 May 2008, Proceedings. Lecture Notes in Computer Science, vol. 4996. Springer, New York (2008)
Lippman S.: C++ Primer, 2nd edn, p. 138. Addison-Wesley, Reading (1991)
Pnueli, A.: Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends. Current Trends in Concurrency. Lecture Notes in Computer Science, vol. 224, pp. 510–584. Springer, Heidelberg (1986)
Roscoe A.W.: The Theory and Practice of Concurrency, pp. 565. Prentice-Hall, Englewood Cliffs (1998)
Valmari, A.: The state explosion problem. Lectures on Petri Nets I: Basic Models. Lecture Notes in Computer Science, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)
Valmari, A. (ed.): Model checking software. In: 13th International SPIN Workshop, Vienna, Austria, March/April 2006, Proceedings. Lecture Notes in Computer Science, vol. 3925. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Valmari, A. Software model checking is a rich research field. Int J Softw Tools Technol Transfer 11, 1–11 (2009). https://doi.org/10.1007/s10009-008-0089-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10009-008-0089-7