Programs with Lists Are Counter Automata

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 abst...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bouajjani, Ahmed, Bozga, Marius, Habermehl, Peter, Iosif, Radu, Moro, Pierre, Vojnar, Tomáš
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Abstract Node Abstract Structure Applied sciences Computer Science Computer science control theory systems Counter Automaton Exact sciences and technology Predicate Abstraction Programming Languages Sharing Point Software Software engineering
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!