Vampire Theorem Prover

Known as: Vampire (disambiguation), Theorem prover Vampire, Vampire reasoner 
Vampire's kernel implements the calculi of ordered binary resolution and superposition for handling equality. The splitting rule and negative… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2001-2018
012320012018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to… (More)
  • figure 3
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2016
2016
This paper introduces a new technique for reasoning with quantifiers and theories. Traditionally, first-order theorem provers… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
2016
2016
This work extends the existing MACE-style finite model finding approach to multi-sorted first-order logic. This existing approach… (More)
  • figure 1
  • table 1
  • table 3
Is this relevant?
2015
2015
In 2009, the symbol elimination method for loop invariant generation was introduced [8], which used saturation theorem proving in… (More)
  • table 1
Is this relevant?
2015
2015
We describe symbol elimination and consequence nding in the rst-order theorem prover Vampire for automatic generation of quanti… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2014
2014
Recently, a new reasoning framework, called AVATAR, integrating first-order theorem proving with SAT solving has been proposed… (More)
  • table 1
  • table 2
  • figure 3
  • figure 4
  • table 3
Is this relevant?
2013
2013
We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2012
2012
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted… (More)
  • table 1
  • table 2
  • table 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
Review
2003
Review
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of… (More)
  • figure 2
Is this relevant?