DeepAI
Log In Sign Up

Concurrent matching logic

09/01/2021
by   ShangBei Wang, et al.
0

Abstract. Matching logic cannot handle concurrency. We introduce concurrent matching logic (CML) to reason about fault-free partial correctness of shared-memory concurrent programs. We also present a soundness proof for concurrent matching logic (CML) in terms of operational semantics. Under certain assumptions, the assertion of CSL can be transformed into the assertion of CML. Hence, CSL can be seen as an instance of CML.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/05/2017

Revisiting concurrent separation logic

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

Formalizing Determinacy of Concurrent Revisions

Concurrent revisions is a concurrency control model designed to guarante...
06/12/2017

Serialisable Multi-Level Transaction Control: A Specification and Verification

We define a programming language independent controller TaCtl for multi-...
04/12/2019

Parity-Based Concurrent Error Detection Schemes for the ChaCha Stream Cipher

We propose two parity-based concurrent error detection schemes for the Q...
10/25/2018

All-Path Reachability Logic

This paper presents a language-independent proof system for reachability...
06/06/2017

Specifying Transaction Control to Serialize Concurrent Program Executions

We define a programming language independent transaction controller and ...
07/27/2020

Extending Concurrent Separation Logic to Enhance Modular Formalization

Nowadays, numerous services based on large-scale distributed systems hav...