Superposition Reasoning about Quantified Bitvector Formulas
Paper i 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.
Författare
David Damestani
Technische Universität Wien
Laura Kovacs
Technische Universität Wien
Chalmers, Data- och informationsteknik, Formella metoder
Martin Suda
Ceske Vysoke Uceni Technicke v Praze
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,
Ämneskategorier
Algebra och logik
Filosofi
Övrig annan teknik
DOI
10.1109/SYNASC49474.2019.00022