Verifying Array Manipulating Programs with Full-Program Induction

February 23, 2020 Β· Declared Dead Β· πŸ› International Conference on Tools and Algorithms for Construction and Analysis of Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat arXiv ID 2002.09857 Category cs.SE: Software Engineering Cross-listed cs.PL Citations 13 Venue International Conference on Tools and Algorithms for Construction and Analysis of Systems Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Software Engineering

Died the same way β€” πŸ‘» Ghosted