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...
| প্রধান লেখক: | , , , , |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | Conference item |
| ভাষা: | English |
| প্রকাশিত: |
Springer
2023
|