arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.00319cs.LOcs.GT
收藏

并发匹配逻辑

Concurrent matching logic

Shangbei Wang

摘要:

抽象的。匹配逻辑不能处理并发。我们引入并发匹配逻辑(CML)来推理共享内存并发程序的无故障部分正确性。我们还提出了并发匹配逻辑(CML)的可靠性证明的操作语义。在一定的假设条件下,CSL的断言可以转化为CML的断言。因此,CSL可以被视为CML的一个实例。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑