Verification of proofs of unsatisfiability for CNF formulas
- 22 December 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Symbolic model checking using SAT procedures instead of BDDsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Tight integration of combinational verification methodsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Using SAT for combinational equivalence checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- Test pattern generation using Boolean satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- A machine program for theorem-provingCommunications of the ACM, 1962