The Vampire and the FOOL
Paper i proceeding, 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

Författare

Evgenii Kotelnikov

Chalmers, Data- och informationsteknik, Programvaruteknik

Laura Kovacs

Chalmers, Data- och informationsteknik, Programvaruteknik

G. Reger

University of Manchester

Andrei Voronkov

Chalmers, Data- och informationsteknik, Programvaruteknik

2016

37-48

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1145/2854065.2854071

ISBN

978-1-4503-4127-1