Explicit Stabilisation for Modular Rely-Guarantee Reasoning

  • John Wickerson
  • Mike Dodds
  • Matthew Parkinson
Conference paper

DOI: 10.1007/978-3-642-11957-6_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6012)
Cite this paper as:
Wickerson J., Dodds M., Parkinson M. (2010) Explicit Stabilisation for Modular Rely-Guarantee Reasoning. In: Gordon A.D. (eds) Programming Languages and Systems. ESOP 2010. Lecture Notes in Computer Science, vol 6012. Springer, Berlin, Heidelberg

Abstract

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • John Wickerson
    • 1
  • Mike Dodds
    • 1
  • Matthew Parkinson
    • 1
  1. 1.University of Cambridge Computer Laboratory 

Personalised recommendations