Verifying Array Manipulating Programs with Full-Program Induction
Not on the map. Why?
Abstract (arXiv)
We present a full-program induction technique for proving (a sub-class of) quantified as well as quantifier-free properties of programs manipulating arrays of parametric size N. Instead of inducting over individual loops, our technique inducts over the entire program (possibly containing multiple loops) directly via the program parameter N. Significantly, this does not require generation or use of loop-specific invariants. We have developed a prototype tool Vajra to assess the efficacy of our technique. We demonstrate the performance of Vajra vis-a-vis several state-of-the-art tools on a set of array manipulating benchmarks.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 23 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.