The Vampire and the FOOL
Paper in proceedings, 2016

This paper presents new features recently implemented in the theorem prover Vampire, namely support for first-order logic with a first class boolean sort (FOOL) and polymorphic arrays. In addition to having a first class boolean sort, FOOL also contains if-then-else and let-in expressions. We argue that presented extensions facilitate reasoning-based program analysis, both by increasing the expressivity of first-order reasoners and by gains in efficiency.

program analysis

program verification

automated theorem proving

TPTP

Vampire

first-order logic

Author

Evgenii Kotelnikov

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Laura Kovacs

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

G. Reger

University of Manchester

Andrei Voronkov

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

2016

37-48

Areas of Advance

Information and Communication Technology

Subject Categories

Computer Science

DOI

10.1145/2854065.2854071

ISBN

978-1-4503-4127-1

More information

Latest update

2/28/2018