Infoscience

Conference paper

A scalable and oblivious atomicity assertion

This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register implementation. The basic idea underlying the low overhead induced by SOAR lies in greedily checking, in a backward manner, specific points of an execution where register operations could be linearized, rather than exploring all possible precedence relations among these.

Fulltext

  • There is no available fulltext. Please contact the lab or the authors.

Related material