Modern shared memory multiprocessors permit reordering of memory operations for performance reasons. These reorderings are often a source of subtle bugs in programs written for such architectures. Traditional approaches to verify weak memory programs often rely on interleaving semantics, which is prone to state space explosion, and thus severely limits the scalability of the analysis. In recent times, there has been a renewed interest in modelling dynamic executions of weak memory programs using partial orders. However, such an approach typically requires ad-hoc mechanisms to correctly capture the data and control-flow choices/conflicts present in real-world programs. In this work, we propose a novel, conflict-aware, composable, truly concurrent semantics for programs written using C/C++ for modern weak memory architectures. We exploit our symbolic semantics based on general event structures to build an efficient decision procedure that detects assertion violations in bounded multi-threaded programs. Using a large, representative set of benchmarks, we show that our conflict-aware semantics outperforms the state-of-the-art partial-order based approaches.
Wed 16 Mar Times are displayed in time zone: (GMT+01:00) Greenwich Mean Time : Belfast change
|10:00 - 10:25|
|Link to publication DOI|
|10:25 - 10:50|
Ganesh NarayanswamyDepartment of Computer Science, University of Oxford, Saurabh JoshiDepartment of Computer Science and Engineering, IIT Guwahati, Daniel KroeningUniversity of OxfordLink to publication DOI
|10:50 - 11:15|
Matthieu PerrinUniversity of Nantes, Achour MostefaouiUniversity of Nantes, Claude JardUniversity of NantesLink to publication DOI