SAT
2005
Springer
14 years 1 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...