The logic allows proofs of parallel programs in which “ownership” of critical data, such as the right to access, update or deallocate a pointer, is transferred.
A semantics for concurrent separation logic - ScienceDirect.com
www.sciencedirect.com › article › pii
Abstract. We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for ...
We introduce a resource-sensitive logic for partial correctness, adapting separation logic to the concurrent setting, as proposed by O'Hearn. The logic allows ...
We present a denotational semantics based on action traces, for parallel programs which share mutable data and synchronize using re- sources and conditional ...
Abstract. This paper presents a new soundness proof for concurrent separation logic (CSL) in terms of a standard operational semantics.
A novel component of this semantics is a modal substructural logic for reasoning about separation in space and evolution in time.
The aim of this work is to present a new soundness proof for the Concurrent Separation Logic, [7], with respect to a structural operational semantics, [11].
Jan 4, 2008 · A novel component of this semantics is a modal substructural logic for reasoning about separation in space and evolution in time.
Concurrent Separation Logic and Operational Semantics. This paper presents a new soundness proof for concurrent separation logic (CSL) in terms of a standard ...
Oct 6, 2017 · In this paper, we develop a game-theoretic account of concurrent separation logic. To every execution trace of the Code confronted to the ...