EWD227 |
Stepwise program construction. |
1–14 |
EWD338 |
Parallelism in multi-record transactions |
15–21 |
EWD376 |
Finding the maximum strong components in a directed graph |
22–30 |
EWD385 |
Trip report E.W.Dijkstra Summer School Munich, July 25 to August 4, 1973 |
31–33 |
EWD386 |
The solution to a cyclic relaxation problem |
34–35 |
EWD387 |
Trip report IBM Seminar “Communication and Computers”, Newcastle, Sept. 1973. |
36–40 |
EWD391 |
Self-stabilization in spite of distributed control |
41–46 |
EWD407 |
Acceptance speech for the AFIPS Harry Goode Memorial Award 1974 |
47–49 |
EWD427 |
Speech at the occasion of an anniversary |
50–53 |
EWD442 |
Inside “Mathematics Inc” |
54–55 |
EWD443 |
A multidisciplinary approach to mathematics |
56–59 |
EWD447 |
On the role of scientific thought |
60–66 |
EWD462 |
A time-wise hierarchy imposed upon the use of a two-level store |
67–78 |
EWD464 |
A new elephant built from mosquitos humming in harmony |
79–83 |
EWD465 |
Monotonic replacement algorithms and their implementation |
84–88 |
EWD466 |
Trip report E.W.Dijkstra, Meeting IFIP W.G.2.3., Munich, 8–14 December 1974 |
89–94 |
EWD474 |
Trip report visit ETH Zurich, 3–4 February 1975 by E.W.Dijkstra |
95–98 |
EWD475 |
A letter to my old friend Jonathan |
99–103 |
EWD480 |
“Craftsman or Scientist?” |
104–109 |
EWD482 |
Exercises in making programs robust |
110–119 |
EWD494 |
Trip report E.W.Dijkstra 16th April/7th May, U.S.A. and Canada |
120–128 |
EWD498 |
How do we tell truths that might hurt? |
129–131 |
EWD501 |
Variations on a theme: an open letter to C.A.R. Hoare |
132–140 |
EWD503 |
A post-scriptum to EWD501. |
141–144 |
EWD504 |
Erratum and embellishments of EWD503 |
145–146 |
EWD508 |
A synthesis emerging? |
147–160 |
EWD512 |
Comments at a Symposium |
161–164 |
EWD513 |
Tripreport E.W.Dijkstra Newcastle, 8–12 September 1975 |
165–168 |
EWD525 |
On a warning from E.A.Hauck |
169–171 |
EWD528 |
More on Hauck’s warning |
172–173 |
EWD538 |
A collection of beautiful proofs |
174–183 |
EWD539 |
Mathematics Inc., a private letter from its Chairman |
184–187 |
EWD553 |
On a gauntlet thrown by David Gries |
357–359 |
EWD554 |
A personal summary of the Gries-Owicki Theory |
188–199 |
EWD561 |
A “non trip report” from E.W.Dijkstra |
200–204 |
EWD563 |
Formal techniques and sizeable programs |
205–214 |
EWD570 |
An exercise for Dr.R.M.Burstall |
215–216 |
EWD573 |
A great improvement |
217–219 |
EWD575 |
To H.D.Mills, Chairman Software Methodology Panel |
220–222 |
EWD576 |
On subgoal induction |
223–224 |
EWD577 |
Tripreport E.W.Dijkstra, ECI-conference 9–12 August 1976, Amsterdam |
225–229 |
EWD578 |
More about the function “fusc” (A sequel to EWD570) |
230–232 |
EWD582 |
A proof of a theorem communicated to us by S.Ghosh |
233–234 |
EWD584 |
Tripreport E.W.Dijkstra, Poland and USSR, 4–25 September 1976 |
235–244 |
EWD585 |
Tripreport E.W.Dijkstra, Tokyo, 28 Sep. – 3 Oct. 1976. |
245–250 |
EWD594 |
A parable. |
251–252 |
EWD603 |
Tripreport E.W.Dijkstra, St.Pierre-de-Chartreuse, 12–19 Dec.1976 |
253–258 |
EWD607 |
A correctness proof for communicating processes: a small exercise. |
259–263 |
EWD608 |
An elephant inspired by the Dutch National Flag |
264–267 |
EWD611 |
On the fact that the Atlantic Ocean has two sides |
268–276 |
EWD613 |
Tripreport E.W.Dijkstra, Australia, 16 February 1977 – 21 March 1977 |
277–283 |
EWD614 |
A somewhat open letter to EAA or: why I proved the boundedness of the non-determinacy in the way I did. |
284–287 |
EWD618 |
On Webster, users, bugs and Aristotle |
288–291 |
EWD622 |
On making solutions more and more fine-grained (In gratitude dedicated to C.A.R.Hoare, D.E.Knuth, and J.F.Traub.) |
292–307 |
EWD623 |
The mathematics behind the Banker’s Algorithm |
308–312 |
EWD629 |
On two beautiful solutions designed by Martin Rem |
313–318 |
EWD635 |
Tripreport E.W.Dijkstra, Newcastle-upon-Tyne, 5-10 Sept. 1977 |
319–323 |
EWD636 |
Why naive program transformation systems are unlikely to work |
324–328 |
EWD637 |
The three golden rules for successful scientific research |
329–330 |
EWD639 |
The introduction of MAES(R) |
331–333 |
EWD643 |
A class of simple communication patterns |
334–337 |
EWD648 |
“Why is software so expensive?” An explanation to the hardware designer. |
338–348 |
EWD650 |
A theorem about odd powers of odd integers. |
349–350 |
EWD671 |
Program inversion |
351–354 |
EWD673 |
On weak and strong termination. |
355–357 |
EWD675 |
The equivalence of bounded nondeterminacy and continuity |
358–359 |
EWD678 |
A story that starts with a very good computer |
360–362 |