Applying SAT methods in unbounded symbolic model checking

DMCA

Applying SAT methods in unbounded symbolic model checking (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by K. L. Mcmillan

Citations:

161 - 2 self

BibTeX

@INPROCEEDINGS{Mcmillan02applyingsat,
    author = {K. L. Mcmillan},
    title = {Applying SAT methods in unbounded symbolic model checking},
    booktitle = {},
    year = {2002},
    pages = {250--264},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

Abstract. A method of symbolic model checking is introduced that uses conjunctive normal form (CNF) rather than binary decision diagrams (BDD’s) and uses a SAT-based approach to quantifier elimination. This method is compared to a traditional BDD-based model checking approach using a set of benchmark problems derived from the compositional verification of a commercial microprocessor design. 1

Keyphrases

unbounded symbolic model sat method conjunctive normal form binary decision diagram commercial microprocessor design benchmark problem symbolic model checking traditional bdd-based model compositional verification sat-based approach

DMCA