论文信息 - Superposition Reasoning about Quantified Bitvector Formulas

Superposition Reasoning about Quantified Bitvector Formulas

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.

Martin Suda | David Damestani | Laura Kovács

[1] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.

[2] Jan Strejcek,et al. Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers , 2018, ICTAC.

[3] Cesare Tinelli,et al. Introducing StarExec: a Cross-Community Infrastructure for Logic Solving , 2014, COMPARE.

[4] Cesare Tinelli,et al. On Solving Quantified Bit-Vectors using Invertibility Conditions , 2018, CAV.

[5] Andrei Voronkov,et al. New Techniques in Clausal Form Generation , 2016, GCAI.

[6] Armin Biere,et al. Complexity of Fixed-Size Bit-Vector Logics , 2016, Theory of Computing Systems.

[7] Andrei Voronkov,et al. First-Order Theorem Proving and Vampire , 2013, CAV.

[8] Andrei Voronkov,et al. Unification with Abstraction and Theory Instantiation in Saturation-Based Reasoning , 2018, TACAS.

[9] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.

[10] Andrei Voronkov,et al. AVATAR: The Architecture for First-Order Theorem Provers , 2014, CAV.

[11] Nikolaj Bjørner,et al. AVATAR Modulo Theories , 2016, GCAI.

[12] Clark W. Barrett,et al. The SMT-LIB Standard Version 2.0 , 2010 .

[13] Laura Kovács,et al. Loop Analysis by Quantification over Iterations , 2018, LPAR.

[14] Armin Biere,et al. Btor2 , BtorMC and Boolector 3.0 , 2018, CAV.