2021
DOI: 10.1145/3434286
|View full text |Cite
|
Sign up to set email alerts
|

On algebraic abstractions for concurrent separation logics

Abstract: Concurrent separation logic is distinguished by transfer of state ownership upon parallel composition and framing. The algebraic structure that underpins ownership transfer is that of partial commutative monoids (PCMs). Extant research considers ownership transfer primarily from the logical perspective while comparatively less attention is drawn to the algebraic considerations. This paper provides an algebraic formalization of ownership transfer in concurrent separation logic by means of structure-preserving p… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 55 publications
0
3
0
Order By: Relevance
“…Local reasoning about concurrent programs has been traditionally the focus of Concurrent Separation Logic (CSL), based on a parallel composition rule [36], initially with a non-interfering (race-free) semantics [8] and later combining ideas of assumeand rely-guarantee [28,38] with local reasoning [22,42] and abstract notions of framing [15,16,21]. However, the body of work on CSL deals almost entirely with sharedmemory multithreading programs, instead of distributed systems, which is the aim of our work.…”
Section: Related Workmentioning
confidence: 99%
“…Local reasoning about concurrent programs has been traditionally the focus of Concurrent Separation Logic (CSL), based on a parallel composition rule [36], initially with a non-interfering (race-free) semantics [8] and later combining ideas of assumeand rely-guarantee [28,38] with local reasoning [22,42] and abstract notions of framing [15,16,21]. However, the body of work on CSL deals almost entirely with sharedmemory multithreading programs, instead of distributed systems, which is the aim of our work.…”
Section: Related Workmentioning
confidence: 99%
“…Local reasoning about parallel programs has been traditionally within the scope of Concurrent Separation Logic (CSL), that introduced a parallel composition rule [36], with a non-interfering (race-free) semantics of shared-memory parallelism [8]. Considering interference in CSL requires more general proof rules, combining ideas of assume-and rely-guarantee [39,29] with local reasoning [26,46] and abstract notions of framing [17,16,25]. These rules generalize from both standard CSL parallel composition and rely-guarantee rules, allowing even to reason about properties of concurrent objects, such as (non-)linearizability [43].…”
Section: Related Workmentioning
confidence: 99%
“…In combination with the proof system reported in [4], the verification method presented in this paper can automatically prove the correctness of a distributed system after the reconfiguration of its coordinating architecture. Since various dialects of (Concurrent) Separation Logic are being commonly used to specify and reason about concurrent systems [5,6,7], we expect this new logic to be easily accepted by the research and development community. The contribution of this paper is three-fold:…”
Section: Contributions Of This Workmentioning
confidence: 99%