Proof Translation and SMT-LIB Benchmark Certification: A Preliminary Report (2008)
by
Yeting Ge
,
Clark Barrett
| 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}
}
Bookmark
 |
 |
 |
 |
 |
 |
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
| 52 | HOL Light: A tutorial introduction - Harrison - 1996 |
| 41 | C.: The Satisfiability Modulo Theories Library (SMT-LIB - Barrett, Stump, et al. - 2010 |
| 22 | Y.: Cooperating Theorem Provers: A Case Study Combining HOL-Light and - McLaughlin, Barrett, et al. - 2006 |
| 12 | A proof-producing boolean search engine - Barrett, Berezin - 2003 |
| 12 | Faster Proof Checking in the Edinburgh Logical Framework - Stump, Dill - 2002 |
| 10 | Towards self-verification of hol light - Harrison - 2006 |
| 7 | Rocket-fast proof checking for SMT solvers - Moskal - 2008 |
| 3 | Integrating a SAT Solver with an LCF-style Theorem Prover - Weber - 2005 |
| 1 | Efficiently checking propositional resolution proofs in isabelle/hol. volume 212 - Weber - 2006 |
