Verifying Bit-vector Invertibility Conditions in Coq (Extended 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 aut...
Main Authors: | Burak Ekici, Arjun Viswanathan, Yoni Zohar, Clark Barrett, Cesare Tinelli |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2019-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1908.09478v1 |
Similar Items
-
Mixing HOL and Coq in Dedukti (Extended Abstract)
by: Ali Assaf, et al.
Published: (2015-07-01) -
Extending SMTCoq, a Certified Checker for SMT (Extended Abstract)
by: Burak Ekici, et al.
Published: (2016-06-01) -
Goal Translation for a Hammer for Coq (Extended Abstract)
by: Łukasz Czajka, et al.
Published: (2016-06-01) -
Verifying Value Iteration and Policy Iteration in Coq
by: Masters, David M.
Published: (2021) -
Formally Verified Code Obfuscation in the Coq Proof Assistant
by: Lu, Weiyun
Published: (2019)