A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Superposition Reasoning about Quantified Bitvector Formulas
2019
2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
We describe recent extensions to the first-order theorem prover Vampire for proving theorems in the theory of fixed-sized bitvectors, possibly with quantifiers. Details are given on extending both the parser of Vampire as well as the theory reasoning framework of Vampire. We present our experimental results by evaluating and comparing our approach to SMT solvers. Our experiments report also on a few examples that can be solved only by our work.
doi:10.1109/synasc49474.2019.00022
dblp:conf/synasc/DamestaniK019
fatcat:jjxlwf4ehjgdngq7azln5djxk4