Paper Info
Title
Oracle semantics for concurrent separation logic
Abstract
We define (with machine-checked proofs in Coq) a modular operational semantics for Concurrent C minor--a language with shared memory, spawnable threads, and first-class locks. By modular we mean that one can reason about sequential control and data-flow knowing almost nothing about concurrency, and one can reason about concurrency knowing almost nothing about sequential control and data-flow constructs. We present a Concurrent Separation Logic with first-class locks and threads, and prove its soundness with respect to the operational semantics. Using our modularity principle, we proved the sequential C.S.L. rules (those inherited from sequential Separation Logic) simply by adapting Appel & Blazy's machine-checked soundness proofs. Our Concurrent C minor operational semantics is designed to connect to Leroy's optimizing (sequential) C minor compiler; we propose our modular semantics as a way to adapt Leroy's compiler-correctness proofs to the concurrent setting. Thus we will obtain end-to-end proofs: the properties you prove in Concurrent Separation Logic will be true of the program that actually executes on the machine.
Year
DOI
Venue
2008
10.1007/978-3-540-78739-6_27
ESOP
Keywords
Field
DocType
first-class lock,sequential c.s.l,modular operational semantics,sequential control,concurrent separation logic,operational semantics,modular semantics,minor operational semantics,sequential separation logic,oracle semantics,concurrent c,shared memory,data flow,separation logic
Operational semantics,Separation logic,Programming language,Computer science,Concurrency,Theoretical computer science,Compiler,Mathematical proof,Modal logic,Soundness,Well-founded semantics
Conference
Volume
ISSN
ISBN
4960
0302-9743
3-540-78738-0
Citations 
PageRank 
References 
62
2.72
8
Authors
3
Name
Order
Citations
PageRank
Aquinas Hobor124317.42
Andrew W. Appel22599292.71
francesco zappa nardelli365428.80