Formalizing Determinacy of Concurrent Revisions
Abstract
Concurrent revisions is a concurrency control model designed to guarantee determinacy, meaning that the outcomes of programs are uniquely determined. This paper describes an Isabelle/HOL formalization of the model's operational semantics and proof of determinacy. We discuss and resolve subtle ambiguities in the operational semantics and simplify the proof of determinacy. Although our findings do not appear to correspond to bugs in implementations, the formalization highlights some of the challenges involved in the design and verification of concurrency control models.
Keywords
Cite
@article{arxiv.1912.09741,
title = {Formalizing Determinacy of Concurrent Revisions},
author = {Roy Overbeek},
journal= {arXiv preprint arXiv:1912.09741},
year = {2019}
}
Comments
To appear in: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP '20), January 20--21, 2020, New Orleans, LA, USA. ACM, New York, NY, USA