Parameterized Verification under TSO with Data Types

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

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Abdulla, Parosh Aziz, Atig, Mohamed Faouzi, Furbach, Florian, Godbole, Adwait A, Hendi, Yacoub G, Krishna, Shankara N, Spengler, Stephan
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computer Sciences
Datavetenskap (datalogi)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 problem for register machines enriched with the given abstract data type.
DOI:10.1007/978-3-031-30823-9_30