Partial Quantifier Elimination and Property Generation

Abstract We study partial quantifier elimination (PQE) for propositional CNF formulas with existential quantifiers. PQE is a generalization of quantifier elimination where one can limit the set of clauses taken out of the scope of quantifiers to a small subset of clauses. The appeal of PQE is that many verification problems (e.g., equivalence checking and model checking) can be solved in terms of PQE and the latter can be dramatically simpler than full quantifier elimination. We show that PQE can be used for property generation that one can view as a generalization of testing. The objective here is to produce anunwantedproperty of a design implementation, thus exposing a bug. We introduce two PQE solvers called $EG \text {-} PQE$ and $EG \text {-} PQE ^+$ . $EG \text {-} PQE$ is a very simple SAT-based algorithm. $EG \text {-} PQE ^+$ is more sophisticated and robust than $EG \text {-} PQE$ . We use these PQE solvers to find an unwanted property (namely, an unwanted invariant) of a buggy FIFO buffer. We also apply them to invariant generation for sequential circuits from a HWMCC benchmark set. Finally, we use these solvers to generate properties of a combinational circuit that mimic symbolic simulation.