go-v.orgdoi

Superposition Reasoning about Quantified Bitvector Formulas

David Damestani, Laura Kovács, Martin Suda · reposiTUm (TU Wien) · 2020

  • DOI 10.34726/342
  • Publisher TU Wien
  • Type other
  • Issued 2020

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

reposiTUm (TU Wien) · TU Wien · other · 2020

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.

Open the resolved locator · 10.34726/342

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 13:35 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://repositum.tuwien.at/handle/20.500.12708/16309
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.