Abstract. Matching logic cannot handle concurrency. We introduce concurrent matching logic (CML) to reason about fault-free partial correctness of shared-memory concurrent programs. We also present a soundness proof for concurrent matching logic (CML) in terms of operational semantics. Under certain assumptions, the assertion of CSL can be transformed into the assertion of CML. Hence, CSL can be seen as an instance of CML.

中文翻译：

---

并发匹配逻辑

摘要。匹配逻辑无法处理并发。我们引入并发匹配逻辑 (CML) 来推理共享内存并发程序的无故障部分正确性。我们还在操作语义方面提出了并发匹配逻辑 (CML) 的健全性证明。在一定的假设下，CSL的断言可以转化为CML的断言。因此，CSL 可以看作是 CML 的一个实例。