Owicki--Gries Logic for Timestamp Semantics

TL;DR

This paper introduces a new non-interference concept and a sound concurrent program logic for weak memory models with delayed store effects, enhancing correctness verification under modern architectures.

Contribution

It proposes a novel non-interference notion and three techniques to adapt Owicki–Gries logic for timestamp semantics in weak memory models.

Findings

Developed a sound logic for weak memory models with delayed store effects.

Introduced three techniques to modify non-interference for such models.

Enhanced understanding of constructing concurrent program logic.

Abstract

Whereas an extension with non-interference of Hoare logic for sequential programs Owicki--Gries logic ensures the correctness of concurrent programs on strict consistency, it is unsound to weak memory models adopted by modern computer architectures and specifications of programming languages. This paper proposes a novel non-interference notion and provides concurrent program logic sound to timestamp semantics corresponding to a weak memory model that allows delays in the effects of store instructions. This paper reports three theoretically interesting techniques for modifying non-interference to support delays in the effects of store instructions. The techniques contribute to a better understanding of constructing concurrent program logic.