The Definition of Standard ML
Lightweight integration of the Ergo theorem prover inside a proof assistant
Proceedings of the second workshop on Automated formal methods
Decision Procedures: An Algorithmic Point of View
Decision Procedures: An Algorithmic Point of View
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Data Compression for Proof Replay
Journal of Automated Reasoning
Isabelle Theories for Machine Words
Electronic Notes in Theoretical Computer Science (ENTCS)
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Fuzzing and delta-debugging SMT solvers
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
HOL-Boogie--An Interactive Prover-Backend for the Verifying C Compiler
Journal of Automated Reasoning
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
Electronic Notes in Theoretical Computer Science (ENTCS)
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Constructive type classes in Isabelle
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Efficiently solving quantified bit-vector formulas
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Extending Sledgehammer with SMT solvers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Compression of propositional resolution proofs via partial regularization
CADE'11 Proceedings of the 23rd international conference on Automated deduction
LCF-style bit-blasting in HOL4
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
SMT solvers: new oracles for the HOL theorem prover
International Journal on Software Tools for Technology Transfer (STTT) - VSTTE 2009
A HOL theory of euclidean space
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Fast LCF-Style proof reconstruction for z3
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The guardol language and verification system
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A DSL for cross-domain security
Proceedings of the 2012 ACM conference on High integrity language technology
| Hi-index | 0.00 |
The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of unsatisfiability proofs for bit-vector theories in the theorem provers HOL4 and Isabelle/HOL. Our work shows that LCF-style proof reconstruction for the theory of fixed-size bit-vectors, although difficult because Z3's proofs provide limited detail, is often possible. We thereby obtain high correctness assurances for Z3's results, and increase the degree of proof automation for bit-vector problems in HOL4 and Isabelle/HOL.