Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

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

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bouajjani, Ahmed, Habermehl, Peter, Rogalewicz, Adam, Vojnar, Tomáš
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Software Software engineering
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!