University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Validating QBF Validity in HOL4

Validating QBF Validity in HOL4

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact William Denman.

The Quantified Boolean Formulae (QBF) solver Squolem can generate certificates of validity, based on Skolem functions. We present independent checking of these certificates in the HOL4 theorem prover. This enables HOL4 users to benefit from Squolem’s automation for valid QBF problems. Detailed performance data shows that LCF -style checking of validity certificates is often (but not always) feasible even for large QBF instances. Additionally, our work provides high correctness assurances for Squolem’s claims of validity and uncovered a soundness bug in a previous version of its certificate validator QBV .

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity