41 search results - page 6 / 9 » Methods for exploiting SAT solvers in unbounded model checki... |
CAV
2006
Springer
14 years 8 days ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
SAT
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
ICTAI
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses...
KBSE
2008
IEEE
14 years 2 months ago
2008
IEEE
Flash memory has become virtually indispensable in most mobile devices. In order for mobile devices to successfully provide services to users, it is essential that flash memory b...
IJFCS
2006
13 years 8 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...