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.
Mon 18 Jan
|14:00 - 14:30|
|14:30 - 15:00|
Lukasz CzajkaUniversity of Innsbruck
|15:00 - 15:30|