We describe the design and the implementation of PAGAI, a new static analyzer working over the LLVM compiler infrastructure, which computes inductive invariants on the numerical variables of the analyzed program. PAGAI implements various state-of-the-art algorithms combining abstract interpretation and decision procedures (SMT-solving), focusing on distinction of paths inside the control flow graph while avoiding systematic exponential enumerations. It is parametric in the abstract domain in use, the iteration algorithm, and the decision procedure. We compared the time and precision of various combinations of analysis algorithms and abstract domains, with extensive experiments both on personal benchmarks and widely available GNU programs.
@article{arxiv.1207.3937,
title = {PAGAI: a path sensitive static analyzer},
author = {Julien Henry and David Monniaux and Matthieu Moy},
journal= {arXiv preprint arXiv:1207.3937},
year = {2012}
}
Comments
Tools for Automatic Program AnalysiS (TAPAS 2012), Deauville : France (2012)