Lingva: Generating and proving program properties using symbol elimination
Paper in proceeding, 2015
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.
Information science
Complex programs
Open source software projects
Computer software
Program properties
Open source software
Elimination method
Software engineering
Open systems
Author
I. Dragan
Vienna University of Technology
Laura Kovacs
Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 8974 67-75978-366246822-7 (ISBN)
Subject Categories
Computer and Information Science
DOI
10.1007/978-3-662-46823-4_6
ISBN
978-366246822-7