Linear Completeness Thresholds for Bounded Model Checking.
Bounded model checking is a symbolic bug-finding method that examines paths of bounded length for violations of a given LTL formula. Its rapid adoption in industry owes much to advances in SAT technology over the past 10-15 years. More recently, there have been increasing efforts to apply SAT-based...
Main Authors: | Kroening, D, Ouaknine, J, Strichman, O, Wahl, T, Worrell, J |
---|---|
Other Authors: | Gopalakrishnan, G |
Format: | Journal article |
Language: | English |
Published: |
Springer
2011
|
Similar Items
-
Completeness and Complexity of Bounded Model Checking
by: Clarke, E, et al.
Published: (2004) -
On the Magnitude of Completeness Thresholds in Bounded Model Checking
by: Bundala, D, et al.
Published: (2012) -
Computational challenges in bounded model checking.
by: Clarke, E, et al.
Published: (2005) -
Computational challenges in bounded model checking
by: Clarke, E, et al.
Published: (2005) -
Computational Challenges in Bounded Model Checking
by: Clarke, E, et al.
Published: (2015)