Efficient SAT-based unbounded symbolic model checking using circuit cofactoring

  title={Efficient SAT-based unbounded symbolic model checking using circuit cofactoring},
  author={Malay K. Ganai and Aarti Gupta and Pranav Ashar},
  journal={IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.},
We describe an efficient approach for SAT-based quantifier elimination that significantly improves the performance of pre-image and fixed-point computation in SAT-based unbounded symbolic model checking (UMC). The proposed method captures a larger set of new states per SAT-based enumeration step during quantifier elimination, in comparison to previous approaches. The novelty of our approach is in the use of circuit-based cofactoring to capture a large set of states, and in the use of a… CONTINUE READING
Highly Cited
This paper has 84 citations. REVIEW CITATIONS
60 Citations
26 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 60 extracted citations

85 Citations

Citations per Year
Semantic Scholar estimates that this publication has 85 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 26 references

SATORI An Efficient Sequential SAT Solver for Circuits

  • M. K. Iyer, G. Parthasarathy, K.-T. Cheng
  • International Conference on Computer-Aided Design…
  • 2003
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…