6608 search results - page 132 / 1322 » On the Completeness of Model Checking |
137
click to vote
SPIN
2007
Springer
15 years 10 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
162
click to vote
KBSE
2005
IEEE
15 years 10 months ago
2005
IEEE
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
134
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
116
click to vote
TACAS
2005
Springer
15 years 10 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
152
click to vote
CMSB
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...