Chapter

Verified Software: Theories, Tools, Experiments

Volume 7152 of the series Lecture Notes in Computer Science pp 98-113

Development and Evaluation of LAV: An SMT-Based Error Finding Platform

System Description
  • Milena Vujošević-JaničićAffiliated withFaculty of Mathematics
  • , Viktor KuncakAffiliated withSchool of Computer and Communication Sciences, EPFL

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present design and evaluation of LAV, a new open-source tool for statically checking program assertions and errors. LAV integrates into the popular LLVM infrastructure for compilation and analysis. LAV uses symbolic execution to construct a first-order logic formula that models the behavior of each basic blocks. It models the relationships between basic blocks using propositional formulas. By combining these two kinds of formulas LAV generates polynomial-sized verification conditions for loop-free code. It uses underapproximating or overapproximating unrolling to handle loops. LAV can pass generated verification conditions to one of the several SMT solvers: Boolector, MathSAT, Yices, and Z3. Our experiments with small 200 benchmarks suggest that LAV is competitive with related tools, so it can be used as an effective alternative for certain verification tasks. The experience also shows that LAV provides significant help in analyzing student programs and providing feedback to students in everyday university practice.