Checking and Enforcing Robustness against TSO

• Published in: Programming Languages and Systems pp. 533 - 553
• Main Authors: Bouajjani, Ahmed, Derevenetc, Egor, Meyer, Roland
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2013
• Series: Lecture Notes in Computer Science
• Subjects: Code Copy; Helper Thread; Model Checker; Parameterized Program; Sequential Consistency
• ISBN: 3642370357; 9783642370359
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-37036-6_29

We present algorithms for checking and enforcing robustness of concurrent programs against the Total Store Ordering (TSO) memory model. A program is robust if all its TSO computations correspond to computations under the Sequential Consistency (SC) semantics. We provide a complete characterization of non-robustness in terms of so-called attacks: a restricted form of (harmful) out-of-program-order executions. Then, we show that detecting attacks can be parallelized, and can be solved using state reachability queries under the SC semantics in a suitably instrumented program obtained by a linear size source-to-source translation. Importantly, the construction is valid for an unbounded number of memory addresses and an arbitrary number of parallel threads. It is independent from the data domain and from the size of store buffers in the TSO semantics. In particular, when the data domain is finite and the number of addresses is fixed, we obtain decidability and complexity results for robustness, even for a parametric number of threads. As a second contribution, we provide an algorithm for computing an optimal set of fences that enforce robustness. We consider two criteria of optimality: minimization of program size and maximization of its performance. The algorithms we define are implemented, and we successfully applied them to analyzing and correcting several concurrent algorithms.