1 citations · 1 across the 3 of their papers we have counts for
4 papers
Verifying Sequential Consistency under Bounded Preemptions
R. Govind, S. Krishna, Sanchari Sil +1
Gibbons and Korach studied a fundamental problem in 1997: given an observed sequence of reads and writes of a multi-threaded program, does there exist an interleaving which is sequ…
Complexity of Consistency Testing for the Release-Acquire Semantics
R. Govind, S. Krishna, Sanchari Sil +1
In a seminal work, Gibbons and Korach studied the complexity of deciding whether an observed sequence of reads and writes of a multi-threaded program admits a sequentially consiste…
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…