基于描述符的并发协助算法的声明式可线性化证明
Declarative Linearizability Proofs for Descriptor-Based Concurrent Helping Algorithms
AI总结:
本文提出用可见性关系公理化替代线性化点,通过形式化事件间协助请求的分离性质,为Harris等人的RDCSS、MCAS等基于描述符的并发协助算法构造了可复用、声明式的可线性化证明。
摘要:
可线性化性是并发算法的标准正确性准则,通常通过建立算法的线性化点来证明。然而,依赖线性化点会导致证明依赖于具体实现,从而阻碍抽象和复用。本文表明,可以通过放弃线性化点、转而采用可见性关系公理化技术来开发更具声明性的证明。虽然可见性关系此前已被考虑过,但本文是首次研究将算法的协助性质形式化这一挑战。特别地,我们表明,通过对包含成批协助请求的事件之间的分离性质进行公理化,可以提取出对Harris等人的若干基于描述符的协助算法(RDCSS、MCAS及其优化)进行高层次理解所需的共性内容,并给出它们可线性化性的新颖证明,这些证明共享大量组成部分。
英文摘要:
Linearizability is a standard correctness criterion for concurrent algorithms, typically proved by establishing the algorithms' linearization points. However, relying on linearization points leads to proofs that are implementation-dependent, and thus hinder abstraction and reuse. In this paper we show that one can develop more declarative proofs by foregoing linearization points and instead relying on a technique of axiomatization of visibility relations. While visibility relations have been considered before, ours is the first study where the challenge is to formalize the helping nature of the algorithms. In particular, we show that by axiomatizing the properties of separation between events that contain bunches of help requests, we can extract what is common for high-level understanding of several descriptor-based helping algorithms of Harris et al. (RDCSS, MCAS, and optimizations), and produce novel proofs of their linearizability that share significant components.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。