Sciweavers

Share
MPC
2015
Springer

On Rely-Guarantee Reasoning

4 years 10 months ago
On Rely-Guarantee Reasoning
Rely-Guarantee reasoning is a well-known method for verification of shared-variable concurrent programs. However, it is difficult for users to define rely/guarantee conditions, which specify threads’ behaviors over the whole program state. Recent efforts to combine Separation Logic with Rely-Guarantee reasoning have made it possible to hide thread-local resources, but the shared resources still need to be globally known and specified. This greatly limits the reuse of verified program modules. In this paper, we propose LRG, a new Rely-Guarantee-based logic that brings local reasoning and information hiding to concurrency verification. Our logic, for the first time, supports a frame rule over rely/guarantee conditions so that specifications of program modules only need to talk about the resources used locally, and the verified modules can be reused in different threads without redoing the proof. Moreover, we introduce a new hiding rule to hide the resources shared by a subse...
Stephan van Staden
Added 15 Apr 2016
Updated 15 Apr 2016
Type Journal
Year 2015
Where MPC
Authors Stephan van Staden
Comments (0)
books