## Proof Translation and SMT-LIB Benchmark Certification: A Preliminary Report (2008)

Venue: | In 6’th International Workshop on SMT |

Citations: | 3 - 1 self |

### BibTeX

@INPROCEEDINGS{Ge08prooftranslation,

author = {Yeting Ge and Clark Barrett},

title = {Proof Translation and SMT-LIB Benchmark Certification: A Preliminary Report},

booktitle = {In 6’th International Workshop on SMT},

year = {2008}

}

### OpenURL

### Abstract

Satisfiability Modulo Theories (SMT) solvers are large and complicated pieces of code. As a result, ensuring their correctness is challenging. In this paper, we discuss a technique for ensuring soundness by producing and checking proofs. We give details of our implementation using CVC3 and HOL Light and provide initial results from our effort to certify the SMT-LIB benchmarks. 1

### Citations

83 |
The Satisfiability Modulo Theories Library (SMTLIB)’, www.SMT-LIB.org
- Ranise, Tinelli
- 2006
(Show Context)
Citation Context ...e describe our experience with this paradigm. The SMT solver is CVC3 [4], and the proof-checker is HOL Light [5]. To motivate and test the system, we applied it to benchmarks from the SMT-LIB library =-=[3]-=-. These benchmarks are used as points of comparison in many papers as well as in the annual SMT-COMP competition. Every benchmark in SMT-LIB contains a status field indicating whether it is satisfiabl... |

68 | HOL Light: A tutorial introduction
- Harrison
- 1996
(Show Context)
Citation Context ...t the same time the set of rules that must be trusted is small and simple. In this paper, we describe our experience with this paradigm. The SMT solver is CVC3 [4], and the proof-checker is HOL Light =-=[5]-=-. To motivate and test the system, we applied it to benchmarks from the SMT-LIB library [3]. These benchmarks are used as points of comparison in many papers as well as in the annual SMT-COMP competit... |

22 | Cooperating theorem provers: A case study combining HOL-Light and CVC Lite
- McLaughlin, Barrett, et al.
(Show Context)
Citation Context ... system ultimately provides a very strong guarantee of correctness, and essentially none of the code of the SMT solver or the proof translator need be trusted. Our own previous work in this direction =-=[7]-=- described our initial efforts to combine CVC Lite and HOL Light. That work emphasized using CVC Lite as an external decision procedure for HOL Light. Here, we emphasize HOL Light’s value as a proof-c... |

17 | Faster Proof Checking in the Edinburgh Logical Framework
- Stump, Dill
- 2002
(Show Context)
Citation Context ...s. One of the primary goals with the CVC family of systems has been to have high confidence in their soundness. The first system, CVC, pioneered the use of proofs within a state-of-the-art SMT solver =-=[9]-=-. The current system, CVC3, builds upon a proof infrastructure developed for CVC Lite [2]. Here, we give a brief overview of CVC3’s proof system. 2.1 Proofs A proof is a tree in which each node is lab... |

16 | Towards self-verification of hol light
- Harrison
- 2006
(Show Context)
Citation Context ...ion is sound and that any theorems proved are valid as long as the logical core is valid. In addition to being small, the 5majority of the trusted core of HOL Light has itself been verified formally =-=[6]-=-. As John Harrison, the author of HOL Light, has stated, “it sets a very exacting standard of correctness”[1]. HOL Light is programmable and can easily be extended. Derived proof rules and decision pr... |

13 |
Rocket-fast proof checking for SMT solvers
- Moskal
- 2008
(Show Context)
Citation Context ... 19153.34 8.85 Burns 14 14 0.30 0.02 14 19.37 1.38 Ricart 14 13 0.89 0.07 13 228.80 17.60 piVC 41 41 4.92 0.12 41 59.40 1.45 Table 1: Results on a selection of AUFLIA benchmarks 6 Related work Moskal =-=[8]-=- proposed a rewriting system for proof checking of SMT solvers. His implementation emphasizes speed and compactness. Our system, while slower, emphasize trustworthiness. Our system ultimately provides... |

12 | A proof-producing boolean search engine
- Barrett, Berezin
- 2003
(Show Context)
Citation Context ...g small, the 5majority of the trusted core of HOL Light has itself been verified formally [6]. As John Harrison, the author of HOL Light, has stated, “it sets a very exacting standard of correctness”=-=[1]-=-. HOL Light is programmable and can easily be extended. Derived proof rules and decision procedures can be implemented as Ocaml functions. Many such derived functions exist as part of HOL Light alread... |

6 | Integrating a SAT solver with an LCF-style theorem prover
- Weber
- 2006
(Show Context)
Citation Context ...roof-producing SAT solver [2]. However, modern SAT solvers like zChaff and Minisat can dump a resolution proof for unsatisfiable formulas. We followed a similar approach to that taken by others (e.g. =-=[11]-=-) to produce a complete proof, given the resolution proof. The rule for propositional resolution can be described as follows. Γ1 ⊢ A ∨ B Γ2 ⊢ ¬A ∨ C bool resolution Γ1 ∪ Γ2 ⊢ B ∨ C We experimented wit... |

2 | Efficiently checking propositional resolution proofs in Isabelle/HOL
- Weber
- 2006
(Show Context)
Citation Context ...ate the following theorem: (A∨B)∧(¬A∨C) ↔ (B ∨C). Unfortunately, translating a large resolution proof using this method turns out to be quite slow. Fortunately, there is a better way. As described in =-=[10]-=-, the representation of CNF clauses can be changed into so-called Sequent Representation. The key idea is to represent the literals of a clause as assumptions. For instance, Γ ⊢ A ∨ B is represented a... |