Towards Counterexample-guided k-Induction for Fast Bug Detection

Mikhail Y.R. Gadelha, Felipe R. Monteiro, Lucas Cordeiro, Denis A Nicole

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

156 Downloads (Pure)


Recently, the k-induction algorithm has proven to be a successful
approach for both finding bugs and proving correctness. However, since the
algorithm is an incremental approach, it might waste resources trying to prove
incorrect programs. In this paper, we propose to extend the k-induction
algorithm in order to shorten the number of steps required to find a property
violation. We convert the algorithm into a meet-in-the-middle bidirectional
search algorithm, using the counterexample produced from over-approximating the
program. The preliminary results show that the number of steps required to find
a property violation is reduced to $\lfloor\frac{k}{2} + 1\rfloor$ and the
verification time for programs with large state space is also reduced considerably.
Original languageEnglish
Title of host publication25th ACM SIGSOFT International Symposium on the Foundations of Software Engineering
Publication statusPublished - 2018


  • Bounded model checking
  • k-induction
  • Formal Software Verification
  • Bug detection


Dive into the research topics of 'Towards Counterexample-guided k-Induction for Fast Bug Detection'. Together they form a unique fingerprint.

Cite this