2026-07-20T06:22:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:728 2024-03-06T11:06:43Z ddc:004 open_access

Lazy Shape Analysis Beyer, Dirk Henzinger, Thomas A. Théoduloz, Grégory Software model checking Shape analysis Counterexample-guided abstraction refinement Interpolation Predicate abstraction 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Dirk Beyer and Thomas A. Henzinger and Grégory Théoduloz 2006 Is Part Of Dagstuhl Seminar Proceedings, Volume 6081, Software Verification: Infinite-State Model Checking and Static Program Analysis (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06081.5 urn:nbn:de:0030-drops-7284 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06081.5 eng https://creativecommons.org/licenses/by/4.0/legalcode