-
Revisiting concurrent separation logic
We present a new soundness proof of Concurrent Separation Logic (CSL) ba...
12/05/2017 ∙ by Pedro Soares, et al. ∙
0
∙
share
read it
-
Formalizing Determinacy of Concurrent Revisions
Concurrent revisions is a concurrency control model designed to guarante...
12/20/2019 ∙ by Roy Overbeek, et al. ∙
0
∙
share
read it
-
Specifying Transaction Control to Serialize Concurrent Program Executions
We define a programming language independent transaction controller and ...
06/06/2017 ∙ by Egon Börger, et al. ∙
0
∙
share
read it
-
Serialisable Multi-Level Transaction Control: A Specification and Verification
We define a programming language independent controller TaCtl for multi-...
06/12/2017 ∙ by Egon Börger, et al. ∙
0
∙
share
read it
-
Concurrent Computing with Shared Replicated Memory
The behavioural theory of concurrent systems states that any concurrent ...
02/13/2019 ∙ by Klaus-Dieter Schewe, et al. ∙
0
∙
share
read it
-
Composing and Decomposing Op-Based CRDTs with Semidirect Products
Operation-based Conflict-free Replicated Data Types (CRDTs) are eventual...
04/08/2020 ∙ by Matthew Weidner, et al. ∙
0
∙
share
read it
-
Parity-Based Concurrent Error Detection Schemes for the ChaCha Stream Cipher
We propose two parity-based concurrent error detection schemes for the Q...
04/12/2019 ∙ by Viola Rieger, et al. ∙
0
∙
share
read it
Concurrent matching logic
09/01/2021 ∙ by ShangBei Wang, et al. ∙
0
∙
share
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
Comments
There are no comments yet.