Download PDFOpen PDF in browser

Theory-Specific Reasoning about Loops with Arrays using Vampire

17 pagesPublished: March 1, 2017


We describe new extensions of the first-order theorem prover Vampire for supporting program analysis and proving properties of loops with arrays. The common theme of our work is the symbol elimination method for generating loop invariants. In our work, we improve symbol elimination for program analysis in two ways. First, we enhance the program analysis framework of Vampire by simplifying skolemization during consequence finding. Second, we extend symbol elimination with theory-specific reasoning, in particular in the theory of polymorphic arrays, and generate and prove program properties over arrays. We illustrate our approach on a number of challenging examples coming from program analysis and verification. Our experiments show that, thanks to our improvements, programs that could not be analyzed before can now be verified with our method.

Keyphrases: consequence finding, invariant generation, polymorphic arrays, program analysis, program verification

In: Laura Kovács and Andrei Voronkov (editors). Vampire 2016. Proceedings of the 3rd Vampire Workshop, vol 44, pages 16--32

BibTeX entry
  author    = {Yuting Chen and Laura Kovacs and Simon Robillard},
  title     = {Theory-Specific Reasoning about Loops with Arrays using Vampire},
  booktitle = {Vampire 2016. Proceedings of the 3rd Vampire Workshop},
  editor    = {Laura Kovacs and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {44},
  pages     = {16--32},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2398-7340},
  url       = {},
  doi       = {10.29007/qk21}}
Download PDFOpen PDF in browser