7 search results - page 2 / 2 » Learning from BDDs in SAT-based bounded model checking |
IFM
2009
Springer
14 years 4 days ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
GLVLSI
2009
IEEE
14 years 10 days ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...