First-Order Theorem Proving and Vampire
Paper in proceeding, 2013
In this paper we give a short introduction in first-order theorem proving
and the use of the theorem prover VAMPIRE. We discuss the superposition
calculus and explain the key concepts of saturation and redundancy elimination,
present saturation algorithms and preprocessing, and demonstrate how these concepts are implemented in VAMPIRE. Further, we also cover more recent topics and features of VAMPIRE designed for advanced applications, including satisfiability checking, theory reasoning, interpolation, consequence elimination, and program analysis.
automated reasoning
theorem proving
program analysis
formal methods
program verification
software engineering
Author
Laura Kovacs
Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)
A. Voronkov
University of Manchester
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 8044 LNCS 1-35978-3-642-39798-1 (ISBN)
Areas of Advance
Information and Communication Technology
Subject Categories
Software Engineering
Computer Science
DOI
10.1007/978-3-642-39799-8_1
ISBN
978-3-642-39798-1