Deciding Robustness against Total Store Ordering
LIAFA, University of Paris 7, France.
We address the problem of deciding robustness of a program against the total store ordering (TSO) relaxed memory model, i.e., of checking whether the behaviour under TSO coincides with the expected sequential consistency (SC) semantics. We prove that this problem is PSPACE-complete. The key insight is that violations to robustness can be detected on pairs of SC computations.
This is a joint work with Roland Meyer and Eike Moehlmann.