Formal verification of bit-vector invertibility conditions in Coq
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 ar...
Main Authors: | Ekici, B, Viswanathan, A, Zohar, Y, Tinelli, C, Barrett, C |
---|---|
Other Authors: | Sattler, U |
Format: | Conference item |
Language: | English |
Published: |
Springer
2023
|
Similar Items
-
Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
by: Burak Ekici, et al.
Published: (2019-08-01) -
Formal Verification of a Topological Spatial Relations Model for Geographic Information Systems in Coq
by: Sheng Yan, et al.
Published: (2023-02-01) -
CoqIOA : a formalization of IO automata in the Coq proof assistant
by: Athalye, Anish (Anish R.)
Published: (2017) -
Formalization of Quantum Protocols using Coq
by: Jaap Boender, et al.
Published: (2015-11-01) -
Enseñando métodos formales con Coq
by: Carlos Daniel Luna
Published: (2006-12-01)