6608 search results - page 28 / 1322 » On the Completeness of Model Checking |
115
click to vote
CHARME
2005
Springer
15 years 6 months ago
2005
Springer
The evolution of SAT technology over the last decade has motivated its application in model checking, initially through the utilization of SAT in bounded model checking (BMC) and, ...
148
Voted
TSE
2011
14 years 7 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
ECOOP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We are interested in the class of systems for which the satisfaction of code dependencies is a dynamic process rather than one which is determined purely at load-time. Ex...
ATVA
2009
Springer
15 years 7 months ago
2009
Springer
Code model checking is a rapidly advancing research topic. However, apart from very constrained scenarios (e.g., verification of device drivers by Slam), the code model checking t...
103
Voted
AMAI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract We present a new approximate verification technique for falsifying the invariants of B models. The technique employs symmetry of B models induced by the use of deferred se...