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

1 Scopus citations

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 → …

Bibliographical note

Publisher Copyright:
© B. Ekici, A. Viswanathan, Y. Zohar, C. Barrett, and C. Tinelli.

Funding

*This work has been partially supported by the Austrian Science Fund (FWF) grant P26201, the European Research Council (ERC) Grant No. 714034 SMART, DARPA award N66001-18-C-4012, and ONR contract N68335-17-C-0558.

FundersFunder number
Office of Naval ResearchN68335-17-C-0558
Defense Advanced Research Projects AgencyN66001-18-C-4012
Horizon 2020 Framework Programme714034
European Commission
Austrian Science FundP26201

    Fingerprint

    Dive into the research topics of 'Verifying bit-vector invertibility conditions in Coq – Extended abstract'. Together they form a unique fingerprint.

    Cite this