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 的例子。