Skip to main content
SpringerLink
Log in

Validating QBF Invalidity in HOL4

  • Conference paper
Interactive Theorem Proving (ITP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6172))

Included in the following conference series:

Abstract

The Quantified Boolean Formulae (QBF) solver Squolem can generate certificates of invalidity, based on Q-resolution. We present independent checking of these certificates in the HOL4 theorem prover. This enables HOL4 users to benefit from Squolem’s automation for QBF problems, and provides high correctness assurances for Squolem’s results. Detailed performance data shows that LCF-style certificate checking is feasible even for large QBF instances. Our work prompted improvements to HOL4’s inference kernel.

This work was supported by the British EPSRC under grant EP/F067909/1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Gopalakrishnan, G., Yang, Y., Sivaraj, H.: QB or not QB: An efficient execution verification tool for memory orderings. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 401–413. Springer, Heidelberg (2004)

    Google Scholar 

  3. Hanna, Z., Dershowitz, N., Katz, J.: Bounded model checking with QBF. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 408–414. Springer, Heidelberg (2005)

    Google Scholar 

  4. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proc. 5th Annual ACM Symp. on Theory of Computing, pp. 1–9 (1973)

    Google Scholar 

  5. Narizzano, M., Peschiera, C., Pulina, L., Tacchella, A.: Evaluating and certifying QBFs: A comparison of state-of-the-art tools. AI Communications 22(4), 191–210 (2009)

    MATH  Google Scholar 

  6. Büning, H.K., Karpinski, M., Flögel, A.: Resolution for quantified boolean formulas. Information and Computation 117(1), 12–18 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Jussila, T., Biere, A., Sinz, C., Kröning, D., Wintersteiger, C.M.: A first step towards a unified proof checker for QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 201–214. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Slind, K., Norrish, M.: A brief overview of HOL4. In: [38], pp. 28–32

    Google Scholar 

  9. Gordon, M.J.C., Pitts, A.M.: The HOL logic and system. In: Towards Verified Systems. Real-Time Safety Critical Systems Series, vol. 2, pp. 49–70. Elsevier, Amsterdam (1994)

    Google Scholar 

  10. Gordon, M., Milner, R., Wadsworth, C.P.: Edinburgh LCF. LNCS, vol. 78. Springer, Heidelberg (1979)

    MATH  Google Scholar 

  11. Gordon, M.: From LCF to HOL: a short history. In: Proof, language, and interaction: essays in honour of Robin Milner, pp. 169–185. MIT Press, Cambridge (2000)

    Google Scholar 

  12. Bertot, Y.: A short presentation of Coq. In: [38], pp. 12–16

    Google Scholar 

  13. Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle framework. In: [38], pp. 33–38

    Google Scholar 

  14. Owre, S., Shankar, N.: A brief overview of PVS. In: [38], pp. 22–27

    Google Scholar 

  15. Kumar, R., Kropf, T., Schneider, K.: Integrating a first-order automatic prover in the HOL environment. In: Archer, M., Joyce, J.J., Levitt, K.N., Windley, P.J. (eds.) Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications, pp. 170–176. IEEE Computer Society, Los Alamitos (1992)

    Google Scholar 

  16. Hurd, J.: An LCF-style interface between HOL and first-order logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 134–138. Springer, Heidelberg (2002)

    Google Scholar 

  17. Meng, J., Paulson, L.C.: Translating higher-order clauses to first-order clauses. Journal of Automated Reasoning 40(1), 35–60 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  18. Weber, T., Amjad, H.: Efficiently checking propositional refutations in HOL theorem provers. Journal of Applied Logic 7(1), 26–40 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  19. Ge, Y., Barrett, C.: Proof translation and SMT-LIB benchmark certification: A preliminary report. In: 6th International Workshop on Satisfiability Modulo Theories, SMT 2008 (2008)

    Google Scholar 

  20. Böhme, S., Weber, T.: Fast LCF-style proof reconstruction for Z3, To appear at the International Conference on Interactive Theorem Proving, ITP-10 (2010)

    Google Scholar 

  21. Letz, R.: Lemma and model caching in decision procedures for quantified boolean formulas. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 5–15. Springer, Heidelberg (2002)

    Google Scholar 

  22. Pulina, L., Tacchella, A.: Learning to integrate deduction and search in reasoning about quantified boolean formulas. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol. 5749, pp. 350–365. Springer, Heidelberg (2009)

    Google Scholar 

  23. Narizzano, M., Pulina, L., Tacchella, A.: Report of the third QBF solvers evaluation. JSAT 2(1-4), 145–164 (2006)

    MATH  Google Scholar 

  24. Amjad, H.: Combining model checking and theorem proving. Technical Report UCAM-CL-TR-601, University of Cambridge Computer Laboratory, Ph.D. Thesis (2004)

    Google Scholar 

  25. Ballarin, C.: Computer algebra and theorem proving. Technical Report UCAM-CL-TR-473, University of Cambridge Computer Laboratory, Ph.D. Thesis (1999)

    Google Scholar 

  26. Boldo, S., Filliâtre, J.C., Melquiond, G.: Combining coq and gappa for certifying floating-point programs. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) Calculemus 2009. LNCS, vol. 5625, pp. 59–74. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  27. Benedetti, M.: sKizzo: A suite to evaluate and certify QBFs. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 369–376. Springer, Heidelberg (2005)

    Google Scholar 

  28. Yu, Y., Malik, S.: Validating the result of a quantified boolean formula (QBF) solver: theory and practice. In: Tang, T. (ed.) Proceedings of the 2005 Conference on Asia South Pacific Design Automation, ASP-DAC 2005, Shanghai, China, January 18-21, pp. 1047–1051. ACM Press, New York (2005)

    Chapter  Google Scholar 

  29. QDIMACS standard version 1.1 (2005) (released on December 21, 2005), http://www.qbflib.org/qdimacs.html (retrieved January 22, 2010)

  30. DIMACS satisfiability suggested format (1993) ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/doc (retrieved January 22, 2010)

  31. Kroening, D., Wintersteiger, C.M.: A file format for QBF certificates (2007), http://www.verify.ethz.ch/qbv/download/qbcformat.pdf (retrieved September 20, 2009)

  32. Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic 5, 56–68 (1940)

    Article  MATH  MathSciNet  Google Scholar 

  33. Damas, L., Milner, R.: Principal type-schemes for functional programs. In: POPL, pp. 207–212 (1982)

    Google Scholar 

  34. Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML– Revised. MIT Press, Cambridge (1997)

    Google Scholar 

  35. Barras, B.: Programming and computing in HOL. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, pp. 17–37. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  36. HOL4 contributors: HOL4 Kananaskis 5 source code (2010), http://hol.sourceforge.net/ (retrieved January 22, 2010)

  37. Harrison, J.: Metatheory and reflection in theorem proving: A survey and critique. Technical Report CRC-053, SRI Cambridge (1995), http://www.cl.cam.ac.uk/~jrh13/papers/reflect.dvi.gz (retrieved April 8, 2010)

  38. Mohamed, O.A., Muñoz, C., Tahar, S. (eds.): TPHOLs 2008. LNCS, vol. 5170. Springer, Heidelberg (2008)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Laboratory, University of Cambridge,  

    Tjark Weber

Authors
  1. Tjark Weber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, University of Texas, Austin, Talyor Hall 2.124, 78712-1188, Austin, TX, USA

    Matt Kaufmann

  2. Computer Laboratory, University of Cambridge, CB3 0FD, Cambridge,, UK

    Lawrence C. Paulson

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weber, T. (2010). Validating QBF Invalidity in HOL4. In: Kaufmann, M., Paulson, L.C. (eds) Interactive Theorem Proving. ITP 2010. Lecture Notes in Computer Science, vol 6172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14052-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14052-5_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14051-8

  • Online ISBN: 978-3-642-14052-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation