Bounded Model Generation for Isabelle/HOL

A translation from higher-order logic (on top of the simply typed λ-calculus) to propositional logic is presented, such that the resulting propositional formula is satisfiable iff the HOL formula has a model of a given finite size. A standard SAT solver can then be used to search for a satisfying assignment, and such an assignment can be transformed back into a model for the HOL formula. The algorithm has been implemented in the interactive theorem prover Isabelle/HOL, where it is used to automatically generate countermodels for non-theorems.

[1]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[2]  Robin Milner,et al.  Definition of standard ML , 1990 .

[3]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[4]  M.J.C. Gordon,et al.  The HOL Logic and System , 1994 .

[5]  Lawrence C. Paulson,et al.  The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..

[6]  Tobias Nipkow,et al.  A Proof Assistant for Higher-Order Logic , 2002 .

[7]  Stefan Berghofer,et al.  Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering , 1999, TPHOLs.

[8]  Alan Bundy,et al.  Finding Counterexamples to Inductive Conjectures and Discovering Security Protocol Attacks , 2002 .

[9]  Markus Wenzel,et al.  Type Classes and Overloading in Higher-Order Logic , 1997, TPHOLs.

[10]  Matthew W. Moskewicz,et al.  Cha : Engineering an e cient SAT solver , 2001, DAC 2001.

[11]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[12]  David Aspinall,et al.  Formalising Java's Data Race Free Guarantee , 2007, TPHOLs.

[13]  T. Tammet.  Finite model building : improvements and omparisonsTanel , 2003 .

[14]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

[15]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[16]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[17]  Lawrence C. Paulson,et al.  Experiments on Supporting Interactive Proof Using Resolution , 2004, IJCAR.

[18]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[19]  K. Claessen,et al.  New Techniques that Improve MACE-style Finite Model Finding , 2007 .

[20]  Daniel Jackson.  Automating first-order relational logic , 2000, SIGSOFT '00/FSE-8.

[21]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[22]  Daniel Sheridan,et al.  The Optimality of a Fast CNF Conversion and its Use with SAT , 2004, SAT.

[23]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[24]  Koen Claessen,et al.  New techniques that improve mace-style model nding , 2003 .