3224 search results - page 362 / 645 » On Checking Model Checkers |
172
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
247
click to vote
STTT
2010
15 years 5 months ago
2010
Tool support for the Java Modeling Language (JML) is a very pressing problem. A main issue with current tools is their architecture: the cost of keeping up with the evolution of Ja...
162
click to vote
KBSE
2007
IEEE
16 years 28 days ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
172
click to vote
ATVA
2004
Springer
15 years 10 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
175
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...