Barriers in Concurrent Separation Logic

From MaRDI portal
Publication:3000585

DOI10.1007/978-3-642-19718-5_15zbMATH Open1326.68096arXiv1203.6412OpenAlexW2153880165MaRDI QIDQ3000585FDOQ3000585


Authors: Aquinas Hobor, Cristian Gherghina Edit this on Wikidata


Publication date: 19 May 2011

Published in: Programming Languages and Systems (Search for Journal in Brave)

Abstract: We develop and prove sound a concurrent separation logic for Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two. Unlike locks and critical sections, Pthreads barriers enable simultaneous resource redistribution between multiple threads and are inherently stateful, leading to significant complications in the design of the logic and its soundness proof. We show how our logic can be applied to a specific example program in a modular way. Our proofs are machine-checked in Coq. We showcase a program verification toolset that automatically applies the logic rules and discharges the associated proof obligations.


Full work available at URL: https://arxiv.org/abs/1203.6412




Recommendations



Cites Work


Cited In (7)

Uses Software





This page was built for publication: Barriers in Concurrent Separation Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000585)