Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Oracle Semantics for Concurrent Separation Logic (Extended Version)

Summary: Oracle Semantics for Concurrent Separation Logic
(Extended Version)
Aquinas Hobor1
Andrew W. Appel1
Francesco Zappa Nardelli2
Princeton University 2
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 al-
most nothing about concurrency, and one can reason about concurrency
knowing almost nothing about sequential control and data-flow con-
structs. We present a Concurrent Separation Logic with first-class locks
and threads, and prove its soundness with respect to the operational se-
mantics. Using our modularity principle, we proved the sequential C.S.L.
rules (those inherited from sequential Separation Logic) simply by adapt-
ing Appel & Blazy's machine-checked soundness proofs. Our Concurrent
C minor operational semantics is designed to connect to Leroy's optimiz-


Source: Appel, Andrew W. - Department of Computer Science, Princeton University
Hobor, Aquinas - School of Computing, National University of Singapore


Collections: Computer Technologies and Information Sciences