Abstract:
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 a...Show MoreMetadata
Abstract:
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.
Published in: 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
Date of Conference: 04-07 September 2019
Date Added to IEEE Xplore: 30 March 2020
ISBN Information:
Contents 