Owicki-Gries reasoning for weak memory models

Ori Lahav, Viktor Vafeiadis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show that even in the absence of auxiliary variables, the well-known Owicki-Gries method for verifying concurrent programs is unsound for weak memory models. By strengthening its non-interference check, however, we obtain OGRA, a program logic that is sound for reasoning about programs in the release acquire fragment of the C11 memory model. We demonstrate the usefulness of this logic by applying it to several challenging examples, ranging from small litmus tests to an implementation of the RCU synchronization primitives.

Original languageEnglish
Title of host publicationAutomata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings
EditorsNaoki Kobayashi, Bettina Speckmann, Kazuo Iwama, Magnus M. Halldorsson
Pages311-323
Number of pages13
DOIs
StatePublished - 2015
Externally publishedYes
Event42nd International Colloquium on Automata, Languages and Programming, ICALP 2015 - Kyoto, Japan
Duration: 6 Jul 201510 Jul 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9135

Conference

Conference42nd International Colloquium on Automata, Languages and Programming, ICALP 2015
Country/TerritoryJapan
CityKyoto
Period6/07/1510/07/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Owicki-Gries reasoning for weak memory models'. Together they form a unique fingerprint.

Cite this