A semantics for concurrent separation logic

A semantics for concurrent separation logic (2004)

by Stephen Brookes

Venue:	Theoretical Computer Science
Citations:	66 - 2 self

Datum	Value	Source
TITLE	A semantics for concurrent separation logic	SVM HeaderParse 0.2
AUTHOR NAME	Stephen Brookes	SVM HeaderParse 0.2
AUTHOR AFFIL	Carnegie Mellon University; Department of Computer Science	SVM HeaderParse 0.2
ABSTRACT	Abstract. We present a denotational semantics based on action traces, for parallel programs which share mutable data and synchronize using resources and conditional critical regions. We introduce a resource-sensitive logic for partial correctness, adapting separation logic to the concurrent setting, as proposed by O’Hearn. The logic allows program proofs in which “ownership ” of a piece of state is deemed to transfer dynamically between processes and resources. We prove soundness of this logic, using a novel “local ” interpretation of traces, and we show that every provable program is race-free. 1	SVM HeaderParse 0.2
YEAR	2004	INFERENCE
VENUE	Theoretical Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	16--34	INFERENCE
VOLUME	3170	INFERENCE
CITATIONS	19 found	ParsCit 1.0