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...
主要な著者: | 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, 等
出版事項: (2004) -
On the Magnitude of Completeness Thresholds in Bounded Model Checking
著者:: Bundala, D, 等
出版事項: (2012) -
Computational challenges in bounded model checking.
著者:: Clarke, E, 等
出版事項: (2005) -
Computational challenges in bounded model checking
著者:: Clarke, E, 等
出版事項: (2005) -
Computational Challenges in Bounded Model Checking
著者:: Clarke, E, 等
出版事項: (2015)