FunArray

A parametric segmentation functor for fully automatic and scalable array content analysis. 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.

This software is also peer reviewed by journal TOMS.


References in zbMATH (referenced in 11 articles , 1 standard article )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Cortesi, Agostino; Ferrara, Pietro; Pistoia, Marco; Tripp, Omer: Datacentric semantics for verification of privacy policy compliance by mobile applications (2015)
  2. Dragan, Ioan; Kovács, Laura: Lingva: generating and proving program properties using symbol elimination (2015)
  3. Alberti, Francesco; Bruttomesso, Roberto; Ghilardi, Silvio; Ranise, Silvio; Sharygina, Natasha: An extension of lazy abstraction with interpolation for programs with arrays (2014)
  4. Alberti, Francesco; Ghilardi, Silvio; Sharygina, Natasha: Booster: an acceleration-based verification framework for array programs (2014)
  5. Cousot, Patrick; Cousot, Radhia: A Galois connection calculus for abstract interpretation (2014)
  6. De Angelis, Emanuele; Fioravanti, Fabio; Pettorossi, Alberto; Proietti, Maurizio: Verifying array programs by transforming verification conditions (2014)
  7. Alberti, Francesco; Bruttomesso, Roberto; Ghilardi, Silvio; Ranise, Silvio; Sharygina, Natasha: Lazy abstraction with interpolants for arrays (2012)
  8. Fulara, Jędrzej: Generic abstraction of dictionaries and arrays (2012)
  9. Cousot, Patrick; Cousot, Radhia; Logozzo, Francesco: A parametric segmentation functor for fully automatic and scalable array content analysis (2011)
  10. Cousot, Patrick; Cousot, Radhia; Logozzo, Francesco: Precondition inference from intermittent assertions and application to contracts on collections (2011)
  11. Fähndrich, Manuel; Logozzo, Francesco: Static contract checking with abstract interpretation (2011)