Counterexample-Guided k-Induction Verification for Fast Bug Detection
share
Recently, the k-induction algorithm has proven to be a successful approach for both finding bugs and proving correctness in program verification. However, since the algorithm is an incremental approach, it might waste resources trying to prove incorrect programs. In this paper, we suggest an extension to the k-induction algorithm, which uses the counterexample produced from over-approximating the loops occurring in the program, in order to shorten the number of steps required to find bugs. We show that our approach can substantially reduce the number steps to find the counterexample.
READ FULL TEXT