Efficient Verification of Concurrent Programs Over TSO Memory Model


We address the problem of efficient verification of multithreaded programs running over Total Store Order (TSO) memory model. It has been shown that even with finite data domain programs, the complexity of control state reachability under TSO is non-primitive recursive. In this paper, we first present a bounded-buffer verification approach wherein a bound… (More)


4 Figures and Tables