Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)

 Burak Ekici (University of Innsbruck) Arjun Viswanathan (University of Iowa) Yoni Zohar (Stanford University) Clark Barrett (Stanford University) Cesare Tinelli (University of Iowa)

 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.

In Giselle Reis and Haniel Barbosa: Proceedings Sixth Workshop on Proof eXchange for Theorem Proving (PxTP 2019), Natal, Brazil, August 26, 2019, Electronic Proceedings in Theoretical Computer Science 301, pp. 18–26.
Presented as an extended abstract.
Published: 23rd August 2019.

 ArXived at: http://dx.doi.org/10.4204/EPTCS.301.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
 Comments and questions to: eptcs@eptcs.org For website issues: webmaster@eptcs.org