Programs with Lists are Counter Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Programs with Lists are Counter Automata

Résumé

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.
Fichier principal
Vignette du fichier
Cav06.pdf (236.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01418919 , version 1 (17-12-2016)

Identifiants

Citer

Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, et al.. Programs with Lists are Counter Automata. 18th International Conference on Computer Aided Verification (CAV 2006), Aug 2006, Seattle, WA, United States. pp.517-531, ⟨10.1007/11817963_47⟩. ⟨hal-01418919⟩
156 Consultations
87 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More