422 search results - page 20 / 85 » Multithreaded SAT Solving |
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
Programs with irregular patterns of dynamic data structures and/or those with complicated control structures such as recursion are notoriously difficult to parallelize efficient...
DAC
2004
ACM
14 years 11 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
CP
2004
Springer
14 years 3 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
VLSID
2010
IEEE
13 years 7 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
SAT
2007
Springer
14 years 4 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...