We present an extended version of the model checking modulo theories framework for verifying parameterized systems under the TSO weak memory model. Our extension relies on three main ingredients: (1) an axiomatic theory of the TSO memory model based on relations over (read, write) events, (2) a TSO-specific backward reachability algorithm and (3) an SMT solver for reasoning about TSO formulas. One of the main originality of our work is a partial order reduction technique that exploits specificities of the TSO memory model. We have implemented this framework in a new version of the Cubicle model checker called Cubicle- $$\mathscr {W}$$ W . Our experiments show that Cubicle- $$\mathscr {W}$$ W is expressive and efficient enough to automatically prove safety of concurrent algorithms, for an arbitrary number of processes, ranging from mutual exclusion to synchronization barriers translated from actual x86-TSO implementations.

中文翻译：

---

TSO弱内存模型的参数化模型检查

我们提出了模型检查模理论框架的扩展版本，用于在 TSO 弱记忆模型下验证参数化系统。我们的扩展依赖于三个主要成分：（1）基于（读、写）事件关系的 TSO 内存模型的公理理论，（2）特定于 TSO 的后向可达性算法和（3）用于推理的 SMT 求解器TSO 公式。我们工作的主要独创性之一是利用 TSO 内存模型的特殊性的偏序减少技术。我们已经在名为 Cubicle- $$\mathscr {W}$$ W 的 Cubicle 模型检查器的新版本中实现了这个框架。我们的实验表明 Cubicle- $$\mathscr {W}$$ W 具有足够的表现力和效率，可以自动证明并发算法的安全性，对于任意数量的进程，