Computational challenges in bounded model checking
We describe several observations regarding the completeness and the complexity of bounded model checking and propose techniques to solve some of the associated computational challenges. We begin by defining the completeness threshold, we prove that the complexity of standard SAT-based BMC is doubly...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
Springer
2005
|