Superposition Reasoning about Quantified Bitvector Formulas
Paper in proceeding, 2020
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.
Author
David Damestani
Vienna University of Technology
Laura Kovacs
Vienna University of Technology
Chalmers, Computer Science and Engineering (Chalmers), Formal methods
Martin Suda
Czech Technical University in Prague
2019 21ST INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2019)
2470-8801 (ISSN)
95-99978-1-7281-5724-5 (ISBN)
21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
Timisoara, Romania,
Timisoara, Romania,
Subject Categories
Algebra and Logic
Philosophy
Other Engineering and Technologies not elsewhere specified
DOI
10.1109/SYNASC49474.2019.00022