Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
Abstract
This work is a part of an ongoing effort to prove the correctness of invertibility conditions for the theory of fixed-width bit-vectors, which are used to solve quantified bit-vector formulas in the Satisfiability Modulo Theories (SMT) solver CVC4. While many of these were proved in a completely automatic fashion for any bit-width, some were only proved for bit-widths up to 65, even though they are being used to solve formulas over arbitrary bit-widths. In this paper we describe our initial efforts in proving a subset of these invertibility conditions in the Coq proof assistant. We describe the Coq library that we use, as well as the extensions that we introduced to it.
Cite
@article{arxiv.1908.09478,
title = {Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)},
author = {Burak Ekici and Arjun Viswanathan and Yoni Zohar and Clark Barrett and Cesare Tinelli},
journal= {arXiv preprint arXiv:1908.09478},
year = {2019}
}
Comments
In Proceedings PxTP 2019, arXiv:1908.08639. Presented as an extended abstract