Deciding Robustness against Total Store Ordering
Ahmed Bouajjani and Roland Meyer and Eike Möhlmann
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II
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.
2011
inproceedings
Springer Berlin Heidelberg
Lecture Notes in Computer Science
428-440
Aceto, Luca and Henzinger, Monika and Sgall, Jiri
6756
