Lingva: Generating and Proving Program Properties Using Symbol Elimination

Conference paper

DOI: 10.1007/978-3-662-46823-4_6

Volume 8974 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Dragan I., Kovács L. (2015) Lingva: Generating and Proving Program Properties Using Symbol Elimination. In: Voronkov A., Virbitskaite I. (eds) Perspectives of System Informatics. PSI 2014. Lecture Notes in Computer Science, vol 8974. Springer, Berlin, Heidelberg

Abstract

We describe the Lingva tool for generating and proving complex program properties using the recently introduced symbol elimination method. We present implementation details and report on a large number of experiments using academic benchmarks and open-source software programs. Our experiments show that Lingva can automatically generate quantified invariants, possibly with alternation of quantifiers, over integers and arrays. Moreover, Lingva can be used to prove program properties expressing the intended behavior of programs.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.TU ViennaViennaAustria
  2. 2.ChalmersGothenburgSweden