A proof technique for register atomicity: Preliminary version

An implementation of a concurrent data object is wait-free if any process can complete any operation in a bounded number of steps, independently of the execution speeds of the programs. Much recent work has been done on concurrent access of shared variables by asynchronous processes. That work shows that implementing such shared variables does not require synchronization (by e.g. mutual exclusion), but can be solved in a wait-free manner. A fruitful paradigm in this context is the notion of a shared register satisfying a niceness condition called atomicity. Recent proposed solutions have led to the realization that: (1) neither the problem to be solved nor the model required were rigorously defined, (2) there was no clear insight in what constitutes a good proof of correctness in the area, and (3) the proposed protocols are so complicated that although correctness may be possible in a "platonic fashion", verifiability seems impossible to attain by human beings. A lot of controversy and allegations about constructions and proofs have arisen. Consequently, we have spent great effort to put the area on a rigorous basis. The thrust of this paper is to provide a new proof technique, and demonstrate its applicability by a non-trivial example. In other words, a new model is rigorously presented for the first time, and then a new method is given for proving register atomicity. It is then used to give a simple proof of the atomicity of the first and only direct construction of a multireader multiwriter register from atomic 1-reader 1-writer registers. (This construction was given in [8], by two of the present authors, with a completely different proof.)