Formalizing Determinacy of Concurrent Revisions

12/20/2019
by   Roy Overbeek, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset