Concurrent separation logic is a development of Hoare logic adapted to deal with pointers and concurrency. Since its inception, it has been enhanced with a treatment of permissions to enable sharing of data between threads, and a treatment of variables as resource alongside heap cells as resource. An introduction to the logic is given with several examples of proofs, culminating in a treatment of Simpson’s 4-slot algorithm, an instance of racy non-blocking concurrency
We define in Coq with machine-checked proofs a modular operational semantics for Concurrent C minor,...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
We present a trace semantics for a language of parallel programs which share access to mutable data....
Abstract. Separation Logic is a recent development in programming logic which has been applied by Pe...
This paper applied the separation logic notions of ownership and permission to ‘stack' variables tha...
AbstractConcurrent separation logic is a Hoare logic for modular reasoning about concurrent heap-man...
Separation logic, originally developed by OÕHearn and Reynolds [1], is an extension of Hoare logic ...
Abstract. After some general remarks about program verification, we introduce separation logic, a no...
AbstractSeparation logic [Reynolds, J. C., Intuitionistic reasoning about shared mutable data struct...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
AbstractConcurrent Separation Logic is a resource-sensitive logic for fault-free partial correctness...
AbstractIn this paper we show how a resource-oriented logic, separation logic, can be used to reason...
Abstract. We develop and prove sound a concurrent separation logic for a language with Pthreads-styl...
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program...
We introduce relaxed separation logic (RSL), the first pro-gram logic for reasoning about concurrent...
We define in Coq with machine-checked proofs a modular operational semantics for Concurrent C minor,...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
We present a trace semantics for a language of parallel programs which share access to mutable data....
Abstract. Separation Logic is a recent development in programming logic which has been applied by Pe...
This paper applied the separation logic notions of ownership and permission to ‘stack' variables tha...
AbstractConcurrent separation logic is a Hoare logic for modular reasoning about concurrent heap-man...
Separation logic, originally developed by OÕHearn and Reynolds [1], is an extension of Hoare logic ...
Abstract. After some general remarks about program verification, we introduce separation logic, a no...
AbstractSeparation logic [Reynolds, J. C., Intuitionistic reasoning about shared mutable data struct...
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an ...
AbstractConcurrent Separation Logic is a resource-sensitive logic for fault-free partial correctness...
AbstractIn this paper we show how a resource-oriented logic, separation logic, can be used to reason...
Abstract. We develop and prove sound a concurrent separation logic for a language with Pthreads-styl...
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program...
We introduce relaxed separation logic (RSL), the first pro-gram logic for reasoning about concurrent...
We define in Coq with machine-checked proofs a modular operational semantics for Concurrent C minor,...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
We present a trace semantics for a language of parallel programs which share access to mutable data....
DOI
Add to ORKG