Published April 15, 2020 | Version v1

Superposition Reasoning about Quantified Bitvector Formulas

  • 1. TU Wien, Austria
  • 2. Czech Technical University in Prague, Czech Republic

Description

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. 

Files

bare_conf.pdf

Files (145.1 kB)

Name Size
md5:6e6bd12a563e1275ffdcab6858f956b0
145.1 kB Preview Download

Additional details

Funding

European Commission
AI4REASON - Artificial Intelligence for Large-Scale Computer-Assisted Reasoning 649043