Chapter

Verification, Model Checking, and Abstract Interpretation

Volume 3855 of the series Lecture Notes in Computer Science pp 157-173

Field Constraint Analysis

  • Thomas WiesAffiliated withMax-Planck-Institut für Informatik
  • , Viktor KuncakAffiliated withMIT Computer Science and Artificial Intelligence Lab
  • , Patrick LamAffiliated withMIT Computer Science and Artificial Intelligence Lab
  • , Andreas PodelskiAffiliated withMax-Planck-Institut für Informatik
  • , Martin RinardAffiliated withMIT Computer Science and Artificial Intelligence Lab

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints enable the application of decidable logics to data structures which were originally beyond the scope of these logics, by verifying the backbone of the data structure and then verifying constraints on fields that cross-cut the backbone in arbitrary ways. Previously, such cross-cutting fields could only be verified when they were uniquely determined by the backbone, which significantly limits the range of analyzable data structures.

Field constraint analysis permits non-deterministic field constraints on cross-cutting fields, which allows the verificiation of invariants for data structures such as skip lists. Non-deterministic field constraints also enable the verification of invariants between data structures, yielding an expressive generalization of static type declarations.

The generality of our field constraints requires new techniques. We present one such technique and prove its soundness. We have implemented this technique as part of a symbolic shape analysis deployed in the context of the Hob system for verifying data structure consistency. Using this implementation we were able to verify data structures that were previously beyond the reach of similar techniques.