Publication

A scalable and oblivious atomicity assertion

Rachid Guerraoui
2008
Conference Papers

Abstract

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.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A scalable and oblivious atomicity assertion

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Proofs, Circuits, and Communication

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier