Belangrijkste concepten
The authors explore the decidability of safety games under Total Store Order (TSO) semantics, presenting different scenarios and strategies for player interactions.
Samenvatting
The content discusses the challenges posed by modern architectures on program execution models, focusing on TSO semantics. It delves into the complexity of safety games in various scenarios where players can update buffers before or after their turns. The authors provide insights into the construction of TSO games and their implications for formal verification processes.
The content also highlights the classification of TSO games into different groups based on buffer update permissions, outlining the decidability results for each group. It concludes with a detailed analysis of Group I, II, and III games, showcasing the ExpTime-completeness and undecidability in specific scenarios.
Overall, the content provides a comprehensive exploration of safety games under TSO semantics, offering valuable insights into formal verification challenges in concurrent programs.
Statistieken
SC is broken due to memory access optimizations.
Reachability problem decidable using alternative semantics.
Termination problem decidable using well-structured transition systems.
Robustness problem PSpace-complete.
Persistence problem PSpace-complete.
ExpTime complexity for decidable games.
Citaten
"The induced state space may be infinite even if the program itself is finite-state."
"Robustness and persistence problems are stronger than safety problem."