Lazy Shape Analysis

Dirk Beyer, Thomas A. Henzinger, and Gregory Theoduloz

Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is difficult to find adequate predicate abstractions for the heap. In contrast, shape analysis, which uses graph-based heap abstractions, can provide a compact representation of recursive data structures. We integrate shape analysis into the software model checker Blast. Because shape analysis is expensive, we do not apply it globally. Instead, we ensure that, like predicates, shape graphs are computed and stored locally, only where necessary for proving the verification goal. To achieve this, we extend lazy abstraction refinement, which so far has been used only for predicate abstractions, to three-valued logical structures. This approach does not only increase the precision of model checking, but it also increases the efficiency of shape analysis. We implemented the technique by extending Blast with calls to TVLA.

Proceedings of the 18th International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 4144, Springer, 2006, pp. 532-546.

Download inofficial, sometimes updated PostScript / PDF document. © 2006 Springer.