Introduction

Abstract

In the two decades since E.W. Dijkstra published a derivation of a synchronization algorithm [17], derivations for many algorithms have appeared in the computer science literature. The presentations are all motivated by a common belief that there is something to be learned from studying how algorithms might be designed from specifications. Yet, in looking at the derivations, one finds an almost overwhelming diversity: in choices of notations and examples, in levels of formality, even in basic underlying research assumptions. Does this diversity make the presentations completely incomparable, or is there a way to abstract from the individual presentations to obtain useful lessons for future research in this area?