Fakultät für Informatik und Mathematik


Paper Description:

BibTeX entry:
author={D. Beyer, M. Dangl, P. Wendler},
title={{Combining k-Induction with Continuously-Refined Invariants}},
institution={{Fakult{\a}t f{\u}r Informatik und Mathematik, Universit{\a}t Passau}},

Bounded model checking (BMC) is a well-knownand successful technique for finding bugs in software. k-inductionis an approach to extend BMC-based approaches from falsification to verification. Automatically generated auxiliary invariants can be used to strengthen the induction hypothesis. We improve this approach and further increase effectiveness and efficiency in the following way: we start with light-weight invariants and refine these invariants continuously during the analysis. We present and evaluate an implementation of our approach in the open-source verification-framework CPA CHECKER . Our experi-
ments show that combining k-induction with continuously-refined invariants significantly increases effectiveness and efficiency, and outperforms all existing implementations of k-induction-based
software verification in terms of successful verification results.

Paper itself: