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 |
---|---|
其他作者: | Gopalakrishnan, G |
格式: | Journal article |
語言: | English |
出版: |
Springer
2011
|
相似書籍
-
Completeness and Complexity of Bounded Model Checking
由: Clarke, E, et al.
出版: (2004) -
On the Magnitude of Completeness Thresholds in Bounded Model Checking
由: Bundala, D, et al.
出版: (2012) -
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)