Skip to main content
NCBI home page
Springer Nature - PMC COVID-19 Collection logoLink to Springer Nature - PMC COVID-19 Collection
. 2020 Mar 13;12078:22–39. doi: 10.1007/978-3-030-45190-5_2

Verifying Array Manipulating Programs with Full-Program Induction

Supratik Chakraborty 10, Ashutosh Gupta 10, Divyesh Unadkat 10,11,✉
Editors: Armin Biere8, David Parker9
PMCID: PMC7439729

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.

Contributor Information

Armin Biere, Email: biere@jku.at.

David Parker, Email: d.a.parker@cs.bham.ac.uk.

Supratik Chakraborty, Email: supratik@cse.iitb.ac.in.

Ashutosh Gupta, Email: akg@cse.iitb.ac.in.

Divyesh Unadkat, Email: divyesh.unadkat@tcs.com.

References

  • 1.Alberti, F., Ghilardi, S., Sharygina, N.: Booster: An acceleration-based verification framework for array programs. In: Proc. of ATVA. pp. 18–23 (2014)
  • 2.Beyer, D., Henzinger, T.A., Majumdar, R., Rybalchenko, A.: Invariant synthesis for combined theories. In: Proc. of VMCAI. pp. 378–394 (2007)
  • 3.Chakraborty, S., Gupta, A., Unadkat, D.: Verifying array manipulating programs with full-program induction, https://www.cse.iitb.ac.in/~supratik/publications/papers/FPI_longversion.html
  • 4.Chakraborty, S., Gupta, A., Unadkat, D.: Verifying Array Manipulating Programs by Tiling. In: Proc. of SAS. pp. 428–449 (2017)
  • 5.Chakraborty, S., Gupta, A., Unadkat, D.: Verifying Array Manipulating Programs with Full-program Induction - Artifacts TACAS 2020. Figshare (2020). 10.6084/m9.figshare.11875428.v1
  • 6.Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. FMSD 19(1), 7–34 (2001)
  • 7.Cousot, P., Cousot, R., Logozzo, F.: A parametric segmentation functor for fully automatic and scalable array content analysis. In: Proc. of POPL. pp. 105–118 (2011)
  • 8.Darke, P., Prabhu, S., Chimdyalwar, B., Chauhan, A., Kumar, S., Basakchowdhury, A., Venkatesh, R., Datar, A., Medicherla, R.K.: VeriAbs: Verification by abstraction and test generation. In: TACAS (Competition Contribution). pp. 457–462 (2018)
  • 9.Ernst, M.D., Perkins, J.H., Guo, P.J., McCamant, S., Pacheco, C., Tschantz, M.S., Xiao, C.: The Daikon system for dynamic detection of likely invariants. Sci. Comput. Program. 69(1-3), 35–45 (2007)
  • 10.Fedyukovich, G., Prabhu, S., Madhukar, K., Gupta, A.: Quantified invariants via syntax-guided-synthesis. In: Proc. of CAV. pp. 259–277 (2019)
  • 11.Ferrante, J., Ottenstein, K.J., Warren, J.D.: The program dependence graph and its use in optimization. TOPLAS 9(3), 319–349 (1987)
  • 12.Flanagan, C., Leino, K.R.M.: Houdini, an annotation assistant for ESC/Java. In: Proc. of FME. pp. 500–517 (2001)
  • 13.Gopan, D., Reps, T.W., Sagiv, S.: A framework for numeric analysis of array operations. In: Proc. of POPL. pp. 338–350 (2005)
  • 14.Gulwani, S., McCloskey, B., Tiwari, A.: Lifting abstract interpreters to quantified logical domains. In: Proc. of POPL. pp. 235–246 (2008)
  • 15.Gurfinkel, A., Shoham, S., Vizel, Y.: Quantifiers on demand. In: Proc. of ATVA. pp. 248–266 (2018)
  • 16.Halbwachs, N., Péron, M.: Discovering properties about arrays in simple programs. In: Proc. of PLDI. pp. 339–348 (2008)
  • 17.Henzinger, T.A., Hottelier, T., Kovács, L., Rybalchenko, A.: Aligators for arrays (tool paper). In: Proc. of LPAR. pp. 348–356 (2010)
  • 18.Jacobs, B., Smans, J., Philippaerts, P., Vogels, F., Penninckx, W., Piessens, F.: VeriFast: A powerful, sound, predictable, fast verifier for C and Java. In: Proc. of NFM. pp. 41–55 (2011)
  • 19.Jhala, R., McMillan, K.L.: Array abstractions from proofs. In: Proc. of CAV. pp. 193–206 (2007)
  • 20.Knobe, K., Sarkar, V.: Array SSA form and its use in parallelization. In: Proc. of POPL. pp. 107–120 (1998)
  • 21.Komuravelli, A., Bjorner, N., Gurfinkel, A., McMillan, K.L.: Compositional verification of procedural programs using Horn clauses over integers and arrays. In: Proc. of FMCAD. pp. 89–96 (2015)
  • 22.Lattner, C.: LLVM and Clang: Next generation compiler technology. In: The BSD Conference. pp. 1–2 (2008)
  • 23.Liu, J., Rival, X.: Abstraction of arrays based on non contiguous partitions. In: Proc. of VMCAI. pp. 282–299 (2015)
  • 24.Monniaux, D., Gonnord, L.: Cell Morphing: From array programs to array-free horn clauses. In: Proc. of SAS. pp. 361–382 (2016)
  • 25.de Moura, L.M., Bjørner, N.: Z3: an efficient SMT solver. In: Proc. ofTACAS. pp. 337–340 (2008)
  • 26.Rajkhowa, P., Lin, F.: Extending VIAP to handle array programs. In: Proc. ofVSTTE. pp. 38–49 (2018)
  • 27.Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Global value numbers and redundantcomputations. In: Proc. of POPL. pp. 12–27 (1988)
  • 28.Seghir, M.N., Brain, M.: Simplifying the verification of quantified arrayassertions via code transformation. In: Proc. of LOPSTR. pp. 194–212(2012)
  • 29.Sheeran, M., Singh, S., Stålmarck, G.: Checking safety properties usinginduction and a SAT-solver. In: Proc. of FMCAD. pp. 127–144 (2000)
  • 30.Srivastava, S., Gulwani, S.: Program verification using templates overpredicate abstraction. ACM Sigplan Notices 44(6), 223–234 (2009)

Articles from Tools and Algorithms for the Construction and Analysis of Systems are provided here courtesy of Nature Publishing Group

RESOURCES