The future is ours: prophecy variables in separation logic

Author:

Jung Ralf1,Lepigre Rodolphe1,Parthasarathy Gaurav2,Rapoport Marianna3,Timany Amin4,Dreyer Derek1,Jacobs Bart4

Affiliation:

1. MPI-SWS, Germany

2. ETH Zurich, Switzerland / MPI-SWS, Germany

3. University of Waterloo, Canada / MPI-SWS, Germany

4. KU Leuven, Belgium

Abstract

Early in the development of Hoare logic, Owicki and Gries introduced auxiliary variables as a way of encoding information about the history of a program’s execution that is useful for verifying its correctness. Over a decade later, Abadi and Lamport observed that it is sometimes also necessary to know in advance what a program will do in the future . To address this need, they proposed prophecy variables , originally as a proof technique for refinement mappings between state machines. However, despite the fact that prophecy variables are a clearly useful reasoning mechanism, there is (surprisingly) almost no work that attempts to integrate them into Hoare logic. In this paper, we present the first account of prophecy variables in a Hoare-style program logic that is flexible enough to verify logical atomicity (a relative of linearizability) for classic examples from the concurrency literature like RDCSS and the Herlihy-Wing queue. Our account is formalized in the Iris framework for separation logic in Coq. It makes essential use of ownership to encode the exclusive right to resolve a prophecy, which in turn enables us to enforce soundness of prophecies with a very simple set of proof rules.

Funder

Horizon 2020

Fonds Wetenschappelijk Onderzoek

Horizon 2020 Framework Programme

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference33 articles.

1. The existence of refinement mappings

2. The existence of refinement mappings

3. Checking interference with fractional permissions;Boyland John;SAS (LNCS),2003

4. Making prophecies with decision predicates

5. TaDA: A logic for time and data abstraction;da Rocha Pinto Pedro;ECOOP (LNCS),2014

Cited by 39 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Verifying Programs with Logic and Extended Proof Rules: Deep Embedding vs. Shallow Embedding;Journal of Automated Reasoning;2024-08-10

2. A Logical Approach to Type Soundness;Journal of the ACM;2024-07-10

3. A Proof Recipe for Linearizability in Relaxed Memory Separation Logic;Proceedings of the ACM on Programming Languages;2024-06-20

4. Scenario-Based Proofs for Concurrent Objects;Proceedings of the ACM on Programming Languages;2024-04-29

5. A Compositional Theory of Linearizability;Journal of the ACM;2024-04-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3