English

Correctness of Concurrent Objects under Weak Memory Models

Programming Languages 2018-10-24 v1 Logic in Computer Science

Abstract

In this paper we develop a theory for correctness of concurrent objects under weak memory models. Central to our definitions is the concept of observations which determine when effects of operations become visible, and hence determine the semantics of objects, under a given memory model. The resulting notion of correctness, called object refinement, is generic as it is parameterised by the memory model under consideration. Our theory enforces the minimal constraints on the placing of observations and on the semantics of objects that underlie object refinement. Object refinement is suitable as a reference for correctness when proving new proof methods for objects under weak memory models to be sound and complete.

Keywords

Cite

@article{arxiv.1810.09612,
  title  = {Correctness of Concurrent Objects under Weak Memory Models},
  author = {Graeme Smith and Kirsten Winter and Robert J. Colvin},
  journal= {arXiv preprint arXiv:1810.09612},
  year   = {2018}
}

Comments

In Proceedings Refine 2018, arXiv:1810.08739. arXiv admin note: text overlap with arXiv:1802.04954

R2 v1 2026-06-23T04:49:12.120Z