Verification by state-space exploration, also often referred to as 'model checking', is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing model-checking techniques are restricted to the verification of properties of models, i.e., abstractions, of concurrent systems. In this paper, we discuss how model checking can be extended to deal directly with 'actual' descriptions of concurrent systems, e.g., implementations of communication protocols written in programming languages such as C or C++. We then introduce a new search technique that is suitable for exploring the state spaces of such systems. This algorithm has been implemented in VeriSoft, a tool for systematically exploring the state spaces of systems composed of several concurrent processes executing arbitrary C code. As an example of application, we describe how VeriSoft successfully discovered an error in a 2500-line C program controlling robots operating in an unpredictable environment.
CITATION STYLE
Godefroid, P. (1997). Model checking for programming languages using VeriSoft. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 174–186). ACM. https://doi.org/10.1145/263699.263717
Mendeley helps you to discover research relevant for your work.