Invariant Generation in Vampire [chapter]

Kryštof Hoder, Laura Kovács, Andrei Voronkov
2011 Lecture Notes in Computer Science  
This paper describes a loop invariant generator implemented in the theorem prover Vampire. It is based on the symbol elimination method proposed by two authors of this paper. The generator accepts a program written in a subset of C, finds loops in it, analyses the loops, generates and outputs invariants. It also uses a special consequence removal mode added to Vampire to remove invariants implied by other invariants. The generator is implemented as a standalone tool, thus no knowledge of theorem proving is required from its users.
doi:10.1007/978-3-642-19835-9_7 fatcat:hvnbjil23jen5dtyozasycpt3e