Counterexample-Guided k-Induction Verification for Fast Bug Detection

06/07/2017
by   Mikhail Y. R. Gadelha, et al.
0

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

page 1

page 2

page 3

page 4

research
04/04/2019

Beyond k-induction: Learning from Counterexamples to Bidirectionally Explore the State Space

We describe and evaluate a novel k-induction proof rule called bidirecti...
research
05/17/2021

Induction and Skolemization in saturation theorem proving

We consider a typical integration of induction in saturation-based theor...
research
03/27/2013

Induction, of and by Probability

This paper examines some methods and ideas underlying the author's succe...
research
04/22/2020

Towards Runtime Verification of Programmable Switches

Is it possible to patch software bugs in P4 programs without human invol...
research
02/08/2022

Evolution of SASyLF 2008-2021

SASyLF was released in 2008 and used as a proof assistant in courses at ...
research
09/20/2019

Automated Verification of Integer Overflow

Integer overflow accounts for one of the major source of bugs in softwar...
research
05/28/2021

Latticed k-Induction with an Application to Probabilistic Programs

We revisit two well-established verification techniques, k-induction and...

Please sign up or login with your details

Forgot password? Click here to reset