@inproceedings{0fc58cf3b9f34670a4485fb8bacb9d27,
title = "On verifying TSO robustness for event-driven asynchronous programs",
abstract = "We present a method for checking whether an event-driven asynchronous program running under the Total Store Ordering (TSO) memory model is robust, i.e., all its TSO computations are equivalent to computations under the Sequential Consistency (SC) semantics. We show that this verification problem can be reduced in polynomial time to a reachability problem in a program with two threads, provided that the original program satisfies a criterion called robustness against concurrency, introduced recently in the literature. This result allows to avoid explicit handling of all concurrent executions in the analysis, which leads to an important gain in complexity.",
author = "Ahmed Bouajjani and Constantin Enea and Madhavan Mukund and Rajarshi Roy",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 6th International Conference on Networked Systems, NETYS 2018 ; Conference date: 09-05-2018 Through 11-05-2018",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-05529-5\_15",
language = "English",
isbn = "9783030055288",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "225--239",
editor = "Andreas Podelski and Fran{\c c}ois Ta{\"i}ani",
booktitle = "Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers",
}