244 search results - page 12 / 49 » Counterexamples in Probabilistic Model Checking |
129
click to vote
MEMOCODE
2003
IEEE
15 years 7 months ago
2003
IEEE
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
146
Voted
ATVA
2008
Springer
15 years 4 months ago
2008
Springer
Goanna is an industrial-strength static analysis tool used in academia and industry alike to find bugs in C/C++ programs. Unlike existing approaches Goanna uses the off-the-shelf N...
CAV
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...
111
click to vote
DAC
2010
ACM
15 years 6 months ago
2010
ACM
Coverage is a means to quantify the quality of a system specification, and is frequently applied to assess progress in system validation. Coverage is a standard measure in testin...
105
click to vote
ICCAD
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...