Verification of partial designs using incremental QBF solving

  title={Verification of partial designs using incremental QBF solving},
  author={Paolo Marin and Christian Miller and Matthew D. T. Lewis and Bernd Becker},
  journal={2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)},
SAT solving is an indispensable core component of numerous formal verification tools and has found widespread use in industry, in particular when using it in an incremental fashion, e.g. in Bounded Model Checking (BMC). On the other hand, there are applications, in particular in the area of partial design verification, where SAT formulas are not expressive enough and a description via Quantified Boolean Formulas (QBF) is much more adequate. In this paper we introduce incremental QBF solving… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS