Kernkonzepte
Safety games in TSO semantics are undecidable due to the control over buffer updates.
Zusammenfassung
The content discusses the extension of Total Store Order (TSO) semantics to safety games, focusing on different formulations and the decidability of safety problems. It explores various scenarios where players can update buffers and presents a classification into four groups based on decidability results. The paper establishes the computational complexity for decidable games and provides insights into formal verification and game theory applications.
Structure:
Introduction to TSO Semantics and Safety Games
Decidability Picture for Safety Game Alternatives
Reachability Problem Analysis under TSO Semantics
Robustness and Persistence Problems for Programs under TSO
Study of Decidability/Complexity Results for Verification under TSO
Statistiken
16種類のTSOゲームがある。
安全性問題はExpTime-hardである。
プログラムの状態到達問題は不可解である。