20 search results - page 1 / 4 » State Set Management for SAT-based Unbounded Model Checking |
ICCD
2005
IEEE
14 years 7 months ago
2005
IEEE
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
ACSD
2007
IEEE
14 years 17 hour ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
ICECCS
2010
IEEE
13 years 10 months ago
2010
IEEE
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
ENTCS
2007
13 years 10 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...