Verifying Array Manipulating Programs with Full-Program Induction
Open Access
- 17 April 2020
- book chapter
- Published by Springer Nature
- Vol. 12078, 22-39
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.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Simplifying the Verification of Quantified Array Assertions via Code TransformationLecture Notes in Computer Science, 2013
- A parametric segmentation functor for fully automatic and scalable array content analysisACM SIGPLAN Notices, 2011
- Program verification using templates over predicate abstractionACM SIGPLAN Notices, 2009
- Discovering properties about arrays in simple programsACM SIGPLAN Notices, 2008
- Lifting abstract interpreters to quantified logical domainsACM SIGPLAN Notices, 2008
- Z3: An Efficient SMT Solver2008
- The Daikon system for dynamic detection of likely invariantsScience of Computer Programming, 2007
- Invariant Synthesis for Combined Theories2007
- A framework for numeric analysis of array operationsACM SIGPLAN Notices, 2005
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987