Proving Simpson's Four-Slot Algorithm Using Ownership Transfer

15 pages•Published: May 15, 2012

Abstract

Simpson's four-slot algorithm has been an instructive example in studying various assertional proof methods/logics geared towards shared variable concurrency. Previously, techniques like rely-guarantee, data refinement and resource separation have been applied to simplify the construction of its correctness proof. Still, an elegant, concise and insightful proof is elusive.

Recently with the new generation of logics coming of age which are, for the first time, equipped with ownership transfer, it becomes imperative to ask to what extent can ownership transfer facilitate a nice proof of the algorithm. Ownership transfer is especially promising here because the conflict resolution mechanism in the four-slot algorithm can be easily recast as an implementation based on ownership transfer.

Keyphrases: concurrency, logic, ownership transfer, verification

In: Markus Aderhold, Serge Autexier and Heiko Mantel (editors). VERIFY-2010. 6th International Verification Workshop, vol 3, pages 126-140.

Links:	https://easychair.org/publications/paper/dJzK
	https://doi.org/10.29007/l2sp

BibTeX entry

@inproceedings{VERIFY-2010:Proving_Simpsons_Four_Slot,
  author    = {Shuling Wang and Xu Wang},
  title     = {Proving Simpson's Four-Slot Algorithm Using Ownership Transfer},
  booktitle = {VERIFY-2010. 6th International Verification Workshop},
  editor    = {Markus Aderhold and Serge Autexier and Heiko Mantel},
  series    = {EPiC Series in Computing},
  volume    = {3},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/dJzK},
  doi       = {10.29007/l2sp},
  pages     = {126-140},
  year      = {2012}}

Download PDF Open PDF in browser