Guerraoui, RachidVukolic, Marko2010-11-302010-11-302010-11-30200810.1007/978-3-540-85361-9_8https://infoscience.epfl.ch/handle/20.500.14299/60971WOS:000259487000004This 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.Shared-MemoryInterprocess CommunicationConcurrent ObjectsDisk PaxosCriteriontext::conference output::conference proceedings::conference paper