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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/01/2021

Concurrent matching logic

Abstract. Matching logic cannot handle concurrency. We introduce concurr...
12/05/2017

Revisiting concurrent separation logic

We present a new soundness proof of Concurrent Separation Logic (CSL) ba...
07/05/2019

Operational Semantics of Games

We introduce operational semantics into games. And based on the operatio...
10/15/2020

Abstract Congruence Criteria for Weak Bisimilarity

We introduce three general compositionality criteria over operational se...
04/08/2020

Composing and Decomposing Op-Based CRDTs with Semidirect Products

Operation-based Conflict-free Replicated Data Types (CRDTs) are eventual...
11/07/2017

A Semantics for Probabilistic Control-Flow Graphs

This article develops a novel operational semantics for probabilistic co...
10/07/2008

The meaning of concurrent programs

The semantics of assignment and mutual exclusion in concurrent and multi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.