TY - GEN
T1 - Explicit Stabilisation for Modular Rely-Guarantee Reasoning
AU - Wickerson, John
AU - Dodds, Mike
AU - Parkinson, Matthew J.
PY - 2010
Y1 - 2010
N2 - We propose a new formalisation of stability for Rely-Guarantee, in which an assertion’s stability is encoded into its syntactic form. This allows two advances in modular reasoning. Firstly, it enables Rely-Guarantee, for the first time, to verify concurrent libraries independently of their clients’ environments. Secondly, in a sequential setting, it allows a module’s internal interference to be hidden while verifying its clients. We demonstrate our approach by verifying, using RGSep, the Version 7 Unix memory manager, uncovering a twenty-year-old bug in the process.
AB - We propose a new formalisation of stability for Rely-Guarantee, in which an assertion’s stability is encoded into its syntactic form. This allows two advances in modular reasoning. Firstly, it enables Rely-Guarantee, for the first time, to verify concurrent libraries independently of their clients’ environments. Secondly, in a sequential setting, it allows a module’s internal interference to be hidden while verifying its clients. We demonstrate our approach by verifying, using RGSep, the Version 7 Unix memory manager, uncovering a twenty-year-old bug in the process.
U2 - 10.1007/978-3-642-11957-6_32
DO - 10.1007/978-3-642-11957-6_32
M3 - Conference contribution
SN - 978-3-642-11956-9
VL - 6012 LNCS
T3 - Lecture Notes in Computer Science
SP - 610
EP - 629
BT - Programming Languages and Systems
PB - Springer
T2 - 19th European Symposium on Programming (ESOP), ETAPS 2010
Y2 - 20 March 2010 through 28 March 2010
ER -