Programs with Lists are Counter Automata

Ahmed Bouajjani (1) , Marius Bozga (2) , Peter Habermehl (1) , Radu Iosif (2) , Pierre Moro (1) , Tomas Vojnar (3)

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

We address the verification problem of programs manipulating one-selector linked data structures. We propose a new automated approach for checking safety and termination for these programs. Our approach is based on using counter automata as accurate abstract models: control states correspond to abstract heap graphs where list segments without sharing are collapsed, and counters are used to keep track of the number of elements in these segments. This allows to apply automatic analysis techniques and tools for counter automata in order to verify list programs. We show the effectiveness of our approach, in particular by verifying automatically termination of some sorting programs.

Mots clés: verification; linked lists; Model Checking

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

Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, et al.. Programs with Lists are Counter Automata. Computer Aided Verification, Aug 2006, Seattle, United States. pp.517-531. ⟨hal-00148002⟩