Hussama Ismail

Handling loops in bounded model checking of C programs via k-induction

The first attempts to apply the k-induction method to software verification are only recent. In this paper, we present a novel proof by induction algorithm, which is built on the top of a symbolic context-bounded model checker and uses an iterative deepening approach to verify, for each step k up to a given maximum, whether a given safety property

Model Checking Embedded C Software Using k-Induction and Invariants

\phi

DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs

ϕ holds in the program. The proposed k-induction algorithm consists of three different cases, called base case, forward condition, and inductive step. Intuitively, in the base case, we aim to find a counterexample with up to k loop unwindings; in the forward condition, we check whether loops have been fully unrolled and that

ESBMC-GPU A context-bounded model checking tool to verify CUDA programs

\phi

Verification of fixed-point digital controllers using direct and delta forms realizations

ϕ holds in all states reachable within k unwindings; and in the inductive step, we check that whenever