arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.05463cs.PLcs.DCcs.LO
收藏

使用偏序证明线性化(扩展版)

Proving Linearizability Using Partial Orders (Extended Version)

Artem Khyzha, Mike Dodds, Alexey Gotsman, Matthew Parkinson

摘要:

可线性化是并发数据结构的正确性的普遍接受的概念。它要求数据结构的任何执行都是通过线性化来证明的-满足数据结构顺序规范的操作的线性顺序。证明可线性化性通常是具有挑战性的,因为操作在线性化顺序中的位置可能取决于未来的操作。这使得在证明中增量地构造线性化非常困难。我们提出了一种新的证明方法,可以处理数据结构与未来相关的线性化。我们的关键思想是逐步构建的操作不是一个单一的线性顺序,而是一个偏序,描述多个线性满足顺序规范。这允许延迟关于操作顺序的决定,反映数据结构实现的行为。我们正式我们的方法作为一个程序逻辑的基础上可靠保证推理,并证明其有效性,通过验证几个具有挑战性的数据结构:Herlihy-Wing队列,TS队列和乐观集。

英文摘要:

Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data structure's sequential specification. Proving linearizability is often challenging because an operation's position in the linearization order may depend on future operations. This makes it very difficult to incrementally construct the linearization in a proof. We propose a new proof method that can handle data structures with such future-dependent linearizations. Our key idea is to incrementally construct not a single linear order of operations, but a partial order that describes multiple linearizations satisfying the sequential specification. This allows decisions about the ordering of operations to be delayed, mirroring the behaviour of data structure implementations. We formalise our method as a program logic based on rely-guarantee reasoning, and demonstrate its effectiveness by verifying several challenging data structures: the Herlihy-Wing queue, the TS queue and the Optimistic set.

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

↑