First-Order Theorem Proving and Vampire
Paper i 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

Författare

Laura Kovacs

Chalmers, Data- och informationsteknik, Programvaruteknik

A. Voronkov

University of Manchester

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. LNCS 8044 1-35

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Programvaruteknik

Datavetenskap (datalogi)

DOI

10.1007/978-3-642-39799-8_1

ISBN

978-3-642-39798-1

Mer information

Senast uppdaterat

2018-02-28