Verification Using k-Induction ?

@inproceedings{Donaldson2011VerificationUK,
  title={Verification Using k-Induction ?},
  author={Alastair F. Donaldson and Leopold Haller and Daniel Kroening and Philipp R{\"u}mmer},
  year={2011}
}
We present combined-case k-induction, a novel technique for verifying software programs. This technique draws on the strengths of the classical inductive-invariant method and a recent application of k-induction to program verification. In previous work, correctness of programs was established by separately proving a base case and inductive step. We present a new k-induction rule that takes an unstructured, reducible control flow graph (CFG), a natural loop occurring in the CFG, and a positive… CONTINUE READING