arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.05740cs.PL
收藏

并发对象的基于场景的证明 [扩展版本]

Scenario-Based Proofs for Concurrent Objects [Extended Version]

Constantin Enea, Eric Koskinen

AI总结:

提出基于场景的并发对象证明技术,将代表性交错形式化为交换性商,并用表达式语言定义抽象以简化线性化证明,在多个经典算法上验证有效。

摘要:

并发对象构成了许多利用多核架构的应用的基础,其重要性引发了非正式的正确性论证以及形式化证明系统。正确性论证(见于分布式计算文献中)对少数规范执行或“场景”给出直观描述,通常每个场景仅涉及少数线程,然而这些直观论证是否具有形式化基础,以及能否扩展到无限多线程的任意交错执行,仍然未知。我们提出了一种新的并发对象证明技术,基于识别少量场景(代表性的、规范的交错执行),并将其形式化为并发对象的交换性商。接下来,我们提供一种表达式语言,用于以正则语言或上下文无关语言的形式定义商的抽象,从而简化线性化证明。这些商表达式将无界交错组织为更易于推理的形式,并明确实现层级的争用/干扰与 ADT 层级转换之间的关系。我们在文献中众多非平凡的并发对象上评估了本工作(包括 Michael-Scott 队列、Elimination 栈、SLS 预留队列、RDCSS 和 Herlihy-Wing 队列)。我们表明,商能够捕捉这些算法的多样特征/复杂性,即使线性化点不直接时也可使用,与原作者的正确性论证相对应,并提供了一些新的基于场景的论证。最后,我们展示了某些对象的商的发现可归约为双线程推理,并给出了一个可从源代码推导候选商表达式的实现。

英文摘要:

Concurrent objects form the foundation of many applications that exploit multicore architectures and their importance has lead to informal correctness arguments, as well as formal proof systems. Correctness arguments (as found in the distributed computing literature) give intuitive descriptions of a few canonical executions or "scenarios" often each with only a few threads, yet it remains unknown as to whether these intuitive arguments have a formal grounding and extend to arbitrary interleavings over unboundedly many threads. We present a novel proof technique for concurrent objects, based around identifying a small set of scenarios (representative, canonical interleavings), formalized as the commutativity quotient of a concurrent object. We next give an expression language for defining abstractions of the quotient in the form of regular or context-free languages that enable simple proofs of linearizability. These quotient expressions organize unbounded interleavings into a form more amenable to reasoning and make explicit the relationship between implementation-level contention/interference and ADT-level transitions. We evaluate our work on numerous non-trivial concurrent objects from the literature (including the Michael-Scott queue, Elimination stack, SLS reservation queue, RDCSS and Herlihy-Wing queue). We show that quotients capture the diverse features/complexities of these algorithms, can be used even when linearization points are not straight-forward, correspond to original authors' correctness arguments, and provide some new scenario-based arguments. Finally, we show that discovery of some object's quotients reduces to two-thread reasoning and give an implementation that can derive candidate quotients expressions from source code.

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

↑