Symbolic Model Checking of Software

@article{Lerda2003SymbolicMC,
  title={Symbolic Model Checking of Software},
  author={Flavio Lerda and Nishant Sinha and Michael Theobald},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2003},
  volume={89},
  pages={480-498}
}
In hardware verification, the introduction of symbolic model checking has been considered a breakthrough, allowing to verify systems clearly out-of-reach of any explicit-state model checker. In contrast, in the verification of concurrent software, model checking is still predominantly performed by explicitstate model checkers such as SPIN. These methods gain much of their efficiency from state-reduction techniques such as partial-order reduction. To achieve a similar breakthrough for software… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS