Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking

Ahmed Bouajjani (1) , Peter Habermehl (1) , Pierre Moro (1) , Tomas Vojnar (2)

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

We address the problem of automatic verification of programs with dynamic data structures. We consider the case of sequential, non-recursive programs manipulating 1-selector-linked structures such as traditional linked lists (possibly sharing their tails) and circular lists. We propose an automata-based approach for a symbolic verification of such programs using the regular model checking framework. Given a program, the configurations of the memory are systematically encoded as words over a suitable finite alphabet, potentially infinite sets of configurations are represented by finite-state automata, and statements of the program are automatically translated into finite-state transducers defining regular relations between configurations. Then, abstract regular model checking techniques are applied in order to automatically check safety properties concerning the shape of the computed configurations or relating the input and output configurations. For that, we introduce new techniques for the computation of abstractions of the set of reachable configurations, and to refine these abstractions if spurious counterexamples are detected. Finally, we present experimental results showing the applicability of the approach and its efficiency.

Mots clés: Regular Model Checking; linked lists; Verification; infinite systems

Domaines: Cryptographie et sécurité [cs.CR]

Ahmed Bouajjani, Peter Habermehl, Pierre Moro, Tomas Vojnar. Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. Tools and Algorithms for the Construction and Analysis of Systems, 11th International Conference,, Apr 2005, Edimbourg, United Kingdom. pp.13-29. ⟨hal-00147978⟩