License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09361.2
URN: urn:nbn:de:0030-drops-24306
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2430/
|
Go to the corresponding Portal |
Tasiran, Serdar ;
Sezgin, Ali ;
Quadeer, Shaz
Verifying Optimistic Concurrency: Prophecy Variables and Backward Reasoning
Abstract
Several static proof systems have been developed over the years for
verifying shared-memory multithreaded programs. These proof systems make use of auxiliary variables to express mutual exclusion or non-interference among shared variable accesses. Typically, the values of these variables summarize the past of the program execution; consequently, they are known as history variables. Prophecy variables, on the other hand, are the temporal dual of history variables and their values summarize the future of the program execution. In this paper, we show that prophecy variables are useful for locally constructing proofs of systems with optimistic concurrency. To enable the fullest use of prophecy variables in proof construction, we introduce tressa annotations, as the dual of the well-known assert annotations. A tressa claim states a condition for reverse reachability from an end state of the program, much like an assert claim states a condition for forward reachability from the initial state of the program.
We present the proof rules and the notion of correctness of a program for two-way reasoning in a static setting: forward in time for assert claims, backward in time for tressa claims. Even though the interaction between the two is non-trivial, the formalization is intuitive and accessible. We demonstrate how to verify implementations based on optimistic concurrency which is a programming paradigm that allows conflicts to be handled after they occur. We have incorporated our proof rules into the QED verifier and have used our implementation to verify a handful of small but sophisticated algorithms. Our experience shows that the proof steps and annotations follow closely the intuition of the programmer, making the proof itself a natural extension of implementation.
BibTeX - Entry
@InProceedings{tasiran_et_al:DagSemProc.09361.2,
author = {Tasiran, Serdar and Sezgin, Ali and Quadeer, Shaz},
title = {{Verifying Optimistic Concurrency: Prophecy Variables and Backward Reasoning}},
booktitle = {Design and Validation of Concurrent Systems},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {9361},
editor = {Cormac Flanagan and Madhusan Parthasarathy and Shaz Quadeer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2010/2430},
URN = {urn:nbn:de:0030-drops-24306},
doi = {10.4230/DagSemProc.09361.2},
annote = {Keywords: Concurrency, Program Verification, Static Analysis}
}
|
Keywords: |
|
Concurrency, Program Verification, Static Analysis |
|
Collection: |
|
09361 - Design and Validation of Concurrent Systems |
|
Issue Date: |
|
2010 |
|
Date of publication: |
|
11.05.2010 |
