Publication Details
A Verification Toolkit for Numerical Transition Systems
Hojjat Hossein
Radu Iosif
Kuncak Viktor
Rummer Philipp
Garnier Florent
integer programs, numerical transition systems, verification, acceleration, predicate abstraction
This paper reports a toolkit and a benchmark suite for rigorous verification of Integer Numerical Transition Systems (INTS), which can be viewed as control-flow graphs whose edges are annotated by Presburger arithmetic formulas. We present FLATA and ELDARICA, two verification tools for INTS. The FLATA system is based on precise acceleration of the transition relation, while the ELDARICA system is based on predicate abstraction with interpolation-based counterexample-driven refinement. The ELDARICA verifier uses the PRINCESS theorem prover as a sound and complete interpolating prover for Presburger arithmetic. Both systems can solve several examples for which previous approaches failed, and present a useful baseline for verifying integer programs. Our infrastructure is publicly available; we hope that it will spur further research, benchmarking, competitions, and synergistic communication between verification tools.
@article{BUT96983,
author="Filip {Konečný} and Hossein {Hojjat} and Iosif {Radu} and Viktor {Kuncak} and Philipp {Rummer} and Florent {Garnier}",
title="A Verification Toolkit for Numerical Transition Systems",
journal="Lecture Notes in Computer Science",
year="2012",
volume="2012",
number="7436",
pages="247--251",
issn="0302-9743"
}