Barriers in Concurrent Separation Logic: Now With Tool Support!

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-57021

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.