Computing over-approximations with bounded model checking
Bounded Model Checking (BMC) searches for counterexamples to a property ϕ with a bounded length k. If no such counterexample is found, k is increased. This process terminates when k exceeds the completeness threshold (i.e., k is sufficiently large to ensure that no counterexample exists) or when th...
主要作者: | Kroening, D |
---|---|
格式: | Journal article |
出版: |
Elsevier
2006
|
相似書籍
-
Computing Over−Approximations with Bounded Model Checking
由: Kroening, D
出版: (2006) -
Computational challenges in bounded model checking
由: Clarke, E, et al.
出版: (2005) -
Computational challenges in bounded model checking.
由: Clarke, E, et al.
出版: (2005) -
Computational Challenges in Bounded Model Checking
由: Clarke, E, et al.
出版: (2015) -
Completeness and Complexity of Bounded Model Checking
由: Clarke, E, et al.
出版: (2004)