Applying SAT Methods in Unbounded Symbolic Model Checking

Download PDF
Open Webpage

Kenneth L. McMillan

Published: 2002, Last Modified: 05 Nov 2025CAV 2002EveryoneRevisionsBibTeXCC BY-SA 4.0
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.