Safety Verification and Refutation by $k$-Invariants and $k$-Induction


Most software verification tools can be classified into one of a number of established families, each of which has their own focus and strengths. For example, concrete counterexample generation in model checking, invariant inference in abstract interpretation and completeness via annotation for deductive verification. This creates a significant and fundamental usability problem as users may have to learn and use one technique to find potential problems but then need an entirely different one to show that they have been fixed. This paper presents a single, unified algorithm kIkI, which strictly generalises abstract interpretation, bounded model checking and k-induction. This not only combines the strengths of these techniques but allows them to interact and reinforce each other, giving a `single-tool' approach to verification.

Static Analysis Symposium
Saurabh Joshi
Saurabh Joshi
Assistant Professor, CSE

My research interests include Constraint Programming, Formal Verification and Program Analysis.