  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.
