Verifying bit-vector invertibility conditions in Coq – Extended abstract

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

doi:10.4204/EPTCS.301.4

Verifying bit-vector invertibility conditions in Coq – Extended abstract

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

Research output: Contribution to journal › Conference article › peer-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 language	English
Pages (from-to)	18-26
Number of pages	9
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	301
DOIs	https://doi.org/10.4204/EPTCS.301.4
State	Published - 23 Aug 2019
Externally published	Yes
Event	6th Workshop on Proof eXchange for Theorem Proving, PxTP 2019 - Natal, Brazil Duration: 26 Aug 2019 → …

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.4204/EPTCS.301.4

Cite this

@article{47adbac05b764878b52dd2aab821ba22,

title = "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.",

author = "Burak Ekici and Arjun Viswanathan and Yoni Zohar and Clark Barrett and Cesare Tinelli",

note = "Publisher Copyright: {\textcopyright} B. Ekici, A. Viswanathan, Y. Zohar, C. Barrett, and C. Tinelli.; 6th Workshop on Proof eXchange for Theorem Proving, PxTP 2019 ; Conference date: 26-08-2019",

year = "2019",

month = aug,

day = "23",

doi = "10.4204/EPTCS.301.4",

language = "الإنجليزيّة",

volume = "301",

pages = "18--26",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

T1 - Verifying bit-vector invertibility conditions in Coq – Extended abstract

AU - Ekici, Burak

AU - Viswanathan, Arjun

AU - Zohar, Yoni

AU - Barrett, Clark

AU - Tinelli, Cesare

PY - 2019/8/23

Y1 - 2019/8/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85072224224&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.301.4

DO - 10.4204/EPTCS.301.4

M3 - مقالة من مؤنمر

SN - 2075-2180

VL - 301

SP - 18

EP - 26

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 6th Workshop on Proof eXchange for Theorem Proving, PxTP 2019

Y2 - 26 August 2019

ER -

Verifying bit-vector invertibility conditions in Coq – Extended abstract

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this