1 citations · 1 across the 3 of their papers we have counts for
4 papers
Reachability and Safety Games under TSO Semantics
Stephan Spengler
We consider games played on the transition graph of concurrent programs running under the Total Store Order (TSO) weak memory model. Games are frequently used to model the interact…
Reachability and Safety Games under TSO Semantics (Extended Version)
Stephan Spengler
We consider games played on the transtion graph of concurrent programs running under the Total Store Order (TSO) weak memory model. Games are frequently used to model the interacti…
TSO Games -- On the decidability of safety games under the total store order semantics
Stephan Spengler, Sanchari Sil
We consider an extension of the classical Total Store Order (TSO) semantics by expanding it to turn-based 2-player safety games. During her turn, a player can select any of the com…
TSO Games -- On the decidability of safety games under the total store order semantics (extended LMCS version with appendix)
Stephan Spengler, Sanchari Sil
We consider an extension of the classical Total Store Order (TSO) semantics by expanding it to turn-based 2-player safety games. During her turn, a player can select any of the com…