Computer Science – Logic in Computer Science
Scientific paper
2012-03-29
LMCS 8 (2:2) 2012
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-8(2:2)2012
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.
Gherghina Cristian
Hobor Aquinas
No associations
LandOfFree
Barriers in Concurrent Separation Logic: Now With Tool Support! does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Barriers in Concurrent Separation Logic: Now With Tool Support!, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Barriers in Concurrent Separation Logic: Now With Tool Support! will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-57021