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...
Autor Principal: | Kroening, D |
---|---|
Formato: | Journal article |
Publicado: |
Elsevier
2006
|
Títulos similares
-
Computing Over−Approximations with Bounded Model Checking
por: Kroening, D
Publicado: (2006) -
Computational challenges in bounded model checking
por: Clarke, E, et al.
Publicado: (2005) -
Computational challenges in bounded model checking.
por: Clarke, E, et al.
Publicado: (2005) -
Computational Challenges in Bounded Model Checking
por: Clarke, E, et al.
Publicado: (2015) -
Completeness and Complexity of Bounded Model Checking
por: Clarke, E, et al.
Publicado: (2004)