A parametric segmentation functor for fully automatic and scalable array content analysis
Authors:
Open Access
- 26 January 2011
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 46 (1) , 105-118
Abstract
We introduce FunArray, a parametric segmentation abstract domain functor for the fully automatic and scalable analysis of array content properties. The functor enables a natural, painless and efficient lifting of existing abstract domains for scalar variables to the analysis of uniform compound data-structures such as arrays and collections. The analysis automatically and semantically divides arrays into consecutive non-overlapping possibly empty segments. Segments are delimited by sets of bound expressions and abstracted uniformly. All symbolic expressions appearing in a bound set are equal in the concrete. The FunArray can be naturally combined via reduced product with any existing analysis for scalar variables. The analysis is presented as a general framework parameterized by the choices of bound expressions, segment abstractions and the reduction operator. Once the functor has been instantiated with fixed parameters, the analysis is fully automatic. We first prototyped FunArray in Arrayal to adjust and experiment with the abstractions and the algorithms to obtain the appropriate precision/ratio cost. Then we implemented it into Clousot, an abstract interpretation-based static contract checker for .NET. We empirically validated the precision and the performance of the analysis by running it on the main libraries of .NET and on its own code. We were able to infer thousands of non-trivial invariants and verify the implementation with a modest overhead (circa 1%). To the best of our knowledge this is the first analysis of this kind applied to such a large code base, and proven to scale.Keywords
This publication has 28 references indexed in Scilit:
- Abstraction Refinement for Quantified Array Assertions2009
- Finding Loop Invariants for Programs over Arrays Using a Theorem Prover2009
- Scalable Shape Analysis for Systems CodeLecture Notes in Computer Science, 2007
- The octagon abstract domainHigher-Order and Symbolic Computation, 2006
- Boogie: A Modular Reusable Verifier for Object-Oriented Programs2006
- Beyond Assertions: Advanced Specification and Verification with JML and ESC/Java22006
- The Spec# Programming System: An Overview2005
- Packet-scheduling algorithm based on priority of separate buffers for unicast and multicast servicesElectronics Letters, 2003
- Deciding Linear Inequalities by Computing Loop ResiduesJournal of the ACM, 1981
- Affine relationships among variables of a programActa Informatica, 1976