Validating the result of a Quantified Boolean Formula (QBF) solver: theory and practice

  • Authors:
  • Yinlei Yu;Sharad Malik

  • Affiliations:
  • Princeton University Princeton, NJ;Princeton University Princeton, NJ

  • Venue:
  • Proceedings of the 2005 Asia and South Pacific Design Automation Conference
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Despite the increasing use of QBF solvers, current QBF solvers do not provide for any mechanism to verify their results. This paper demonstrates a methodology for independently validating the results of a DLL based QBF solver using the traces generated during the solving process. It also presents a mechanism to extract small unsatisfiable subformulas, called cores, from unsatisfiable QBF instances.