Reconstruction of Z3's Bit-Vector Proofs in HOL4 and Isabelle/HOL [chapter]

Sascha Böhme, Anthony C. J. Fox, Thomas Sewell, Tjark Weber
2011 Lecture Notes in Computer Science  
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
more » ... utomation for bit-vector problems in HOL4 and Isabelle/HOL.
doi:10.1007/978-3-642-25379-9_15 fatcat:gesxkp2cm5girliosyngzyuwmi