Edsger Wybe Dijkstra (1930–2002) was one of the most influential researchers in the history of computer science, making fundamental contributions to both the theory and practice of computing. Early in his career, he proposed the single-source shortest path algorithm, now commonly referred to as Dijkstra’s algorithm. He wrote (with Jaap Zonneveld) the first ALGOL 60 compiler, and designed and implemented with his colleagues the influential THE operating system. Dijkstra invented the field of concurrent algorithms, with concepts such as mutual exclusion, deadlock detection, and synchronization. A prolific writer and forceful proponent of the concept of structured programming, he convincingly argued against the use of the Go To statement. In 1972 he was awarded the ACM Turing Award for “fundamental contributions to programming as a high, intellectual challenge; for eloquent insistence and practical demonstration that programs should be composed correctly, not just debugged into correctness; for illuminating perception of problems at the foundations of program design.” Subsequently he invented the concept of self-stabilization relevant to fault-tolerant computing. He also devised an elegant language for nondeterministic programming and its weakest precondition semantics, featured in his influential 1976 book A Discipline of Programming in which he advocated the development of programs in concert with their correctness proofs. In the later stages of his life, he devoted much attention to the development and presentation of mathematical proofs, providing further support to his long-held view that the programming process should be viewed as a mathematical activity.
In this unique new book, 31 computer scientists, including five recipients of the Turing Award, present and discuss Dijkstra’s numerous contributions to computing science and assess their impact. Several authors knew Dijkstra as a friend, teacher, lecturer, or colleague. Their biographical essays and tributes provide a fascinating multi-author picture of Dijkstra, from the early days of his career up to the end of his life.
Table of Contents
The Humble Programmer
Dijkstra’s Single Source Shortest Path Algorithm
Programming Concurrent Systems
Concurrent Algorithms
Origin of Self-Stabilization
Djikstra’s Legacy on Program Verification
Development of Correct Programs
Nondeterminism and Guarded Commands
A Personal View of Edsger W. Dijkstra and His Stance on Software Construction
Calculations Proofs
An Homge to the Beautiful Mathematical EWDs
A Note on Two Problems in Connexion with Graphs
Recursive Programming
Some Meditations on Advanced Programming
Solution of a Problem in Concurrent Programming Control
Go To Statement Considered Harmful
The Structure of “THE”-Multiprogramming System
Self-Stabilizing Systems in Spite of Distributed Content
On-the-Fly Garbage Collection: An Exercise in Cooperation
Edsger Dijkstra, The Man Who Carried Computer Science on His Shoulders
Memories of Edsger W. Dijkstra
Reflections on Edsger and His Influence
Forty Years with Edsger
Edsger Dijkstra—Some Reminiscences
Evoking Whitehead’s Dictum
Edsger W. Dijkstra in the Eyes of His Friends, Colleagues, and Students
Edsger W. Dijkstra as a Lecturer in Marktoberdorf
The Edsger W. Dijkstra Archive
About the Author(s)
Krzysztof R. Apt, Centre Mathematics and Computer Science, Amsterdam
Krzysztof R. Apt is a Fellow at CWI (Centre Mathematics and Computer Science) in Amsterdam and Affiliated Professor at the University of Warsaw. He is also Professor Emeritus at the University of Amsterdam. He earned his Ph.D. degree in mathematics from the Polish Academy of Sciences in Warsaw in 1974. During his scientific career, he held tenure positions in Poland, France, the USA, and the Netherlands. Apt published four books and several articles in computer science, mathematical logic, and, more recently, theoretical economics. In computer science his research interests have included program correctness and semantics, use of logic as a programming language, design of programming languages, distributed computing, and algorithmic game theory. For the past 20 years he has been involved in a number of initiatives aiming at open access to scientific publications. He is a member of Academia Europaea, the founder and first Editor-in-Chief of the ACM Transactions on Computational Logic, and past president of the Association for Logic Programming. Together with Tony Hoare, he is the editor of this volume.
Tony Hoare, Microsoft Research, Cambridge
Tony Hoare was on the faculty of the Queen’s University of Belfast from 1968 until 1977. He moved to Oxford University as Professor of Computation in 1977, where he remained until his retirement from academia in 1999. Shortly thereafter he joined the Microsoft Research Laboratory in Cambridge (UK). His research has spanned several aspects of programming including design of data structures and programming languages, program verification, and concurrency. He invented Quicksort, conceived Hoare logic, proposed (jointly with Per Brinch Hansen) the concept of a monitor, and introduced Communicating Sequential Processes both as a language for distributed programming and, later, as a formalism to reason about concurrency and nondeterminism. His more recent work is concerned with the Unifying Theories of Programming. Hoare received the Turing Award in 1980, the Harry H. Goode Memorial Award in 1981, the Kyoto Prize in 2000, and the IEEE John von Neumann Medal in 2011. In 2000, he was knighted by the British Queen for services to education and computer science. He holds honorary doctorates from several universities and is a fellow or foreign member of various learned societies, including the UK Royal Society, the UK Royal Academy of Engineering, the US National Academy of Sciences, the US National Academy of Engineering, and the Computer History Museum. Together with Krzysztof R. Apt, he is the editor of this volume.
