Abstract

This paper reviews some important ideas which have emerged from the work of Dijkstra. In particular it examines his technique of structuring programs so that the process scheduling algorithms are easy to understand and verify. The paper then reviews some synchronisation techniques and presents the reasons for favouring the techniques that neatly exploit Dijkstra's work. The paper is expository rather than original.

You do not currently have access to this article.