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...
Päätekijät: | Kroening, D, Ouaknine, J, Strichman, O, Wahl, T, Worrell, J |
---|---|
Muut tekijät: | Gopalakrishnan, G |
Aineistotyyppi: | Journal article |
Kieli: | English |
Julkaistu: |
Springer
2011
|
Samankaltaisia teoksia
-
Completeness and Complexity of Bounded Model Checking
Tekijä: Clarke, E, et al.
Julkaistu: (2004) -
On the Magnitude of Completeness Thresholds in Bounded Model Checking
Tekijä: Bundala, D, et al.
Julkaistu: (2012) -
Computational challenges in bounded model checking.
Tekijä: Clarke, E, et al.
Julkaistu: (2005) -
Computational challenges in bounded model checking
Tekijä: Clarke, E, et al.
Julkaistu: (2005) -
Computational Challenges in Bounded Model Checking
Tekijä: Clarke, E, et al.
Julkaistu: (2015)