Verifying bit-vector invertibility conditions in Coq – Extended abstract

Burak Ekici, Arjun Viswanathan, Yoni Zohar, Clark Barrett, Cesare Tinelli

Research output: Contribution to journalConference articlepeer-review

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.

Original languageEnglish
Pages (from-to)18-26
Number of pages9
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume301
DOIs
StatePublished - 23 Aug 2019
Externally publishedYes
Event6th Workshop on Proof eXchange for Theorem Proving, PxTP 2019 - Natal, Brazil
Duration: 26 Aug 2019 → …

All Science Journal Classification (ASJC) codes

  • Software

Cite this