Hoare-Style Specifications As Correctness Conditions For Non-Linearizable Concurrent Objects

SPLASH '16: Conference on Systems, Programming, Languages, and Applications: Software for Humanity Amsterdam Netherlands November, 2016(2016)

引用 28|浏览112
暂无评分
摘要
Designing efficient concurrent objects often requires abandoning the standard specification technique of linearizability in favor of more relaxed correctness conditions. However, the variety of alternatives makes it difficult to choose which condition to employ, and how to compose them when using objects specified by different conditions.In this work, we propose a uniform alternative in the form of Hoare logic, which can explicitly capture-in the auxiliary state-the interference of environment threads. We demonstrate the expressiveness of our method by verifying a number of concurrent objects and their clients, which have so far been specified only by non-standard conditions of concurrency-aware linearizability, quiescent, and quantitative quiescent consistency. We report on the implementation of the ideas in an existing Coq-based tool, providing the first mechanized proofs for all the examples in the paper.
更多
查看译文
关键词
Concurrency,Hoare logic,linearizability,quiescent consistency,counting networks,mechanized proofs,Theory,Verification
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要