Parameterized Verification under TSO with Data Types

We consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the reachability problem for such systems to the reachability prob...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Abdulla, Parosh Aziz, Atig, Mohamed Faouzi, Furbach, Florian, Godbole, Adwait, Hendi, Yacoub G, Krishna, Shankaranarayanan, Spengler, Stephan
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Formal Languages and Automata Theory Computer Science - Programming Languages
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!