Explicit Stabilisation for Modular Rely-Guarantee Reasoning

John Wickerson, Mike Dodds, Matthew J. Parkinson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationProgramming Languages and Systems
Subtitle of host publication19th European Symposium on Programming, ESOP 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings
PublisherSpringer
Pages610-629
Number of pages20
Volume6012 LNCS
ISBN (Electronic)978-3-642-11957-6
ISBN (Print)978-3-642-11956-9
DOIs
Publication statusPublished - 2010
Event19th European Symposium on Programming (ESOP), ETAPS 2010 - Paphos, Cyprus
Duration: 20 Mar 201028 Mar 2010

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume6012
ISSN (Print)0302-9743

Conference

Conference19th European Symposium on Programming (ESOP), ETAPS 2010
Country/TerritoryCyprus
CityPaphos
Period20/03/1028/03/10

Cite this