The future is ours: prophecy variables in separation logic
Open Access
- 20 December 2019
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 4 (POPL) , 1-32
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.Keywords
Funding Information
- Horizon 2020 (731453)
- Fonds Wetenschappelijk Onderzoek
- Horizon 2020 Framework Programme (683289)
This publication has 26 references indexed in Scilit:
- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity2015
- A Structural Approach to Prophecy VariablesLecture Notes in Computer Science, 2012
- Expressive modular fine-grained concurrency specificationACM SIGPLAN Notices, 2011
- VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java2011
- Resources, concurrency, and local reasoningTheoretical Computer Science, 2007
- The existence of refinement mappings2003
- The existence of refinement mappingsTheoretical Computer Science, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- An axiomatic proof technique for parallel programs IActa Informatica, 1976
- ReductionCommunications of the ACM, 1975