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 | |
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 → … |
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.
Funders | Funder number |
---|---|
Office of Naval Research | N68335-17-C-0558 |
Defense Advanced Research Projects Agency | N66001-18-C-4012 |
Horizon 2020 Framework Programme | 714034 |
European Commission | |
Austrian Science Fund | P26201 |