Formal Verification of Bit-Vector Invertibility Conditions in Coq

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We prove the correctness of invertibility conditions for the theory of fixed-width bit-vectors—used to solve quantified bit-vector formulas in the Satisfiability Modulo Theories (SMT) solver cvc5— in the Coq proof assistant. Previous work proved many of these in a completely automatic fashion for arbitrary bit-width; however, some were only proved for bit-widths up to 65, even though they are being used to solve formulas over larger bit-widths. In this paper we describe the process of proving a representative subset of these invertibility conditions in Coq. In particular, we describe the BVList library for bit-vectors in Coq, our extensions to it, and proofs of the invertibility conditions.

Original languageEnglish
Title of host publicationFrontiers of Combining Systems - 14th International Symposium, FroCoS 2023, Proceedings
EditorsUli Sattler, Martin Suda
PublisherSpringer Science and Business Media Deutschland GmbH
Pages41-59
Number of pages19
ISBN (Print)9783031433689
DOIs
StatePublished - 2023
Event14th International Symposium on Frontiers of Combining Systems, FroCoS 2023 - Prague, Czech Republic
Duration: 20 Sep 202322 Sep 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14279 LNAI

Conference

Conference14th International Symposium on Frontiers of Combining Systems, FroCoS 2023
Country/TerritoryCzech Republic
CityPrague
Period20/09/2322/09/23

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Formal Verification of Bit-Vector Invertibility Conditions in Coq'. Together they form a unique fingerprint.

Cite this