Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

Ahmed Bouajjani (1) , Peter Habermehl (1) , Adam Rogalewicz (2) , Tomas Vojnar (2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 FIT / BUT - Faculty of Information Technology [Brno]

We consider the verification of non-recursive C programs manipulating dynamic linked data structures with possibly several next pointer selectors and with finite domain non-pointer data. We aim at checking basic memory consistency properties (no null pointer assignments, etc.) and shape invariants whose violation can be expressed in an existential fragment of a first order logic over graphs. We formalise this fragment as a logic for specifying bad memory patterns whose formulae may be translated to testers written in C that can be attached to the program, thus reducing the verification problem considered to checking reachability of an error control line. We encode configurations of programs, which are essentially shape graphs, in an original way as extended tree automata and we represent program statements by tree transducers. Then, we use the abstract regular tree model checking framework for a fully automated verification. The method has been implemented and successfully applied on several case studies.

Mots clés: regular model-checking; trees; pointers

Domaines: Performance et fiabilité [cs.PF]

Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomas Vojnar. Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. Static Analysis Symposium, 2006, Seoul, South Korea. pp.52-70. ⟨hal-00150139⟩