The EWDs A list of all of the EWDs in the EWD online archive

28 Substitution processes 1962 376 Finding the maximum strong components in a directed graph 1973 553pubOn a gauntlet thrown by David Gries1976 683 To a new member of The Tuesday Afternoon Club 1978 31 Synchronisatie van parallelle sequentiele processen 376pubFinding the maximum strong components in a directed graph 1982 554 A personal summary of the Gries-Owicki theory 1976 684 Termination detection for diffusing computations 33 Over uitwisselbaarheid 379 On a connection pattern between 2**N elements 1973 554pubA personal summary of the Gries-Owicki Theory 1982 (with C.S.Scholten)685 The problem of the Swiss football players 1978 35 Over de sequentialiteit van procesbeschrijvingen 384 Betrouwbaarheid van programma’s 1973 555 Aan de Raad van Advies 1976 687 Termination detection for diffusing computations (with C.S.Scholten)687a Termination detection for 36 Over ongewenste faciliteiten 385 Trip report E.W.Dijkstra Summer School Munich, July 25 to August 4, 1973 1973 556 Zesde toespraak tot mijn studenten, voorjaar 1976 1976 diffusing computations (with C.S.Scholten) 37 A review of the IBM 1620 Data Processing System 1963 385pubTrip report E.W.Dijkstra Summer School Munich, July 25 to August 4, 1973 1982 557 Zevende toespraak tot mijn studenten, voorjaar 1976 1976 687apubTermination detection for diffusing computations 1980 41 Het vectorgeheugen n.d. 386 The solution to a cyclic relaxation problem 1973 558 Achtste toespraak tot mijn studenten, voorjaar 1976 1976 688 A trifle 1978 51 Multiprogrammering en de X8 n.d. 386pubThe solution to a cyclic relaxation problem 1982 559 Negende toespraak tot mijn studenten, voorjaar 1976 1976 689 Tripreport E.W.Dijkstra, Valley Forge, 28 Oct. -2 Nov. 1978 1978 54 Multiprogrammering en de X8 (Vervolg van EWD51) n.d. 387 Trip report IBM Seminar “Communication and Computers”, Newcastle, Sept. 1973 1973 560 Tiende toespraak tot mijn studenten, voorjaar 1976 1976 690 The pragmatic engineer versus the scientific designer 1978 56 Korte notitie over de buffering van startopdrachten 387pubTrip report IBM Seminar “Communication and Computers”, Newcastle, Sept. 1973 1982 561 A “non trip report” from E.W.Dijkstra 1976 691 On improving the state of the art (A somewhat open letter to dr. Martin Rem) 1978 57 Multiprogrammering en de X8 (Vervolg van EWD54) 1963 389 Trip report I.U.C.C. Colloquium, Canterbury, 18th—21st Sept. 1973 1973 561pubA “non trip report” from E.W.Dijkstra 1982 692 A review of the 1977 Turing Award Lecture by John Backus 1978 62 Notitie over de aansluiting en de programmering van de teleprinter 1963 391 Self-stabilization in spite of distributed control 1973 562 The effective arrangement of logical systems 1976 693 About polygons in Detroit 1978 65 Over Jansen 1963 391pubSelf-stabilization in spite of distributed control 1982 563 Formal techniques and sizeable programs 1976 694 Tripreport E.W.Dijkstra, Detroit, Austin, Philadelphia, 25 Nov. - 9 Dec. 1978 1978 68 Some comments on the aims of MIRFAC n.d. 392 Self-stabilization with four-state machines 1973 563pubFormal techniques and sizeable programs 1982 695 Mathematics in an easy chair 1978 69 Over stapeladministratie 1963 393 On representational abstraction 1973 564 A superficial book 1976 696 Written in anger 1978 70 Over stapeladministratie. II n.d. 395 Trip report E.W.Dijkstra IFIP Working Group W.G.2.3 “On Programming Methodology’’, 21st - 26th 564a Aan de Raad van Advies, in tweede ronde. 1976 697 Some beautiful arguments using mathematical induction 1978 71 Over pagina-administratie n.d. October 1973, Blanchland, England 1973 565 Elfde toespraak tot mijn studenten, voorjaar 1976 1976 697pubSome beautiful arguments using mathematical induction 1980 72 Over trommelpaginatransporten 1963 396 Self-stabilization with three-state machines 1973 566 Programming: from craft to scientific discipline 1976 698 Trip report E.W.Dijkstra, Oxford University, 10-15 Jan. 1979 1979 74 Over seinpalen n.d. 397 Self-stabilizing systems with distributed control 1973 567 Twaalfde toespraak tot mijn studenten, voorjaar 1976 1976 699 Een reactie 1979 75 Over standaardroutines 398 Sequencing primitives revisited 1973 568 A programmer’s early memories 1976 700 An examination exercise, designed by W.H.J.Feijen 1979 77 Het controlerende communicatieapparaat n.d. 399 An immediate sequel to EWD398: “Sequencing primitives revisited’’ 1973 568pubA programmer’s early memories 1980 701 Two theorems on (what I have called) continuously mixed sequences 1979 82 Een ponsbandorganisatie voor de X8 n.d. 401 The characterization of semantics n.d. 569 Dertiende en laatste toespraak tot mijn studenten, voorjaar 1976 1976 702 In reaction to Ernest Chang’s “Deadlock Detection” 1979 84 Over paginaadministratie 1964 401pubThe characterization of semantics 1976 570 An exercise for Dr.R.M.Burstall 1976 703 A tutorial on the split binary semaphore 1979 86 Bezettingsadministratie der trommelpagina’s1964 404 A trip to France: 13th-20th December 1973 1973 570pubAn exercise for Dr.R.M.Burstall 1982 704 A machine for image construction in tomography 1979 89 Over formal locations 1964 405 Synchronisatie en sequencingn.d. 571 A simple consideration with far-reaching consequences (DRAFT) 1976 705 Verkavelde berekeningen, hun mogelijkheden en moeilijkheden 1979 91 Samenvatting van oordeel over het “Voorstel tot aanschaffing van een digitale 406 A trip to the U.S.A., 5th - 25th January 1974 1974 572 Tripreport E.W.Dijkstra, U.S.A. and U.K., 8 June - 10 July 1976 1976 705pubVerkavelde berekeningen, hun mogelijkheden en moeilijkheden 1979 informatieverwerkende machine voor de afdeling der elektrotechniek’’ 1964 407 Acceptance speech for the AFIPS Harry Goode Memorial Award 1974 1974 573 A great improvement 1976 706 Image reconstruction in two-dimensional tomography 1979 96 Embedding complex arithmetic 1964 407pubAcceptance speech for the AFIPS Harry Goode Memorial Award 1974 1974 573pubA great improvement 1982 707 Dear Mr.X of Company Y 1979 101 Description of the object program n.d. 408 A time-wise hierarchy imposed upon the use of a two-level store n.d. 574 A letter to Professor Zohar Manna, 26 July 1976 1976 708 When messages may crawl 1979 102 Description of the object program, II 1964 409 The semantic characterization of a programming language 575 To H.D.Mills, Chairman Software Methodology Panel 1976 709 My hopes of computing science 1979 105 Description of the object program (a sequel to EWD102) n.d. 410 Two theorems 575pubTo H.D.Mills, Chairman Software Methodology Panel 1982 709pubMy hopes of computing science 1979 108 Een algorithme ter voorkoming van de dodelijke omarming n.d. 411 On the design of properly terminating constructs 576 On subgoal induction 1976 710 When messages may crawl, II (A sequel to EWD708) 1979 111 Error checking1964 412 Euclid’s algorithm revisited 576pubOn subgoal induction 1982 711 Trip report E.W.Dijkstra, Ithaca, Albany, Austin (Texas), 26/5 - 10/6 1979 1979 112 Ruwe schets vertaalproces 1964 413 The formal treatment of some small examples 577 Tripreport E.W.Dijkstra, ECI-conference 9-12 August 1976, Amsterdam 1976 712 Trip report E.W.Dijkstra, Antwerp, 24-29 June 19791979 113 Segment control 1964 415 A beautiful proof of a probably useless theorem (with W.H.J.Feijen) n.d. 577pubTripreport E.W.Dijkstra, ECI-conference 9-12 August 1976, Amsterdam 1982 713 On a problem posed by W.H.J.Feijen 1979 116 De bankiersalgorithme en verfijningen daarvan n.d. 416 On avoiding the infinite n.d. 578 More about the function “fusc” (A sequel to EWD570) 1976 714 Trip report E.W.Dijkstra, Mission Viejo, Santa Cruz, Austin, 29 July - 8 September 1979 1979 117 Programming considered as a human activity n.d. 417 On the abolishment of the subscripted variable 1974 578pubMore about the function “fusc” (A sequel to EWD570) 1982 715 Trip report E.W.Dijkstra, Munich - London, 16-29 September 19791979 117pubProgramming considered as a human activity n.d. 418 Guarded commands, non-determinacy and a calculus for the derivation of programs 1974 580 Waarom de onderafdeling der wiskunde zich met de informatica moet bezighouden 1976 716 A short talk to my students about money 1979 118 Communicatiebuffering voor de EL-X8 - T.H.E. 1965 420 Tripreport E.W.Dijkstra, Luxembourg, 7 - 12 April 1974 1974 581 A somewhat open letter to Professor John McCarthy1976 717 An exercise in exposition 1979 123 Cooperating sequential processes 1968 423 Trip report E.W.Dijkstra, W.G.2.3 Meeting “Boldern” 28th April - 3rd May 1974 1974 582 A proof of a theorem communicated to us by S.Ghosh (with C.S.Scholten) 1976 718 Assembly conventions for the EDSAC 1979 123pubCooperating sequential processes 1968 424 An essay on the notion: “the scope of variables” 582pubA proof of a theorem communicated to us by S.Ghosh 1982 719 On not duplicating volatile information 1979 126 The multiprogramming system for the EL X8 THE 1965 425 Trip report E.W.Dijkstra, USA and Canada, 5th - 25th May 1974 1974 583 Eerste toespraak tot mijn studenten, najaar 1976 1976 720 Why correctness must be a mathematical concern 1979 130 A sequel to EWD126 n.d. 426 Self-stabilizing systems in spite of distributed control 1974 584 Tripreport E.W.Dijkstra, Poland and USSR, 4-25 September 1976 1976 721 The design of a state space with a useful structure (I) 1979 NN131Verslag van bezoek aan de Arbeitstagung fuer Automatentheorie te Hanover 426pubSelf-stabilizing systems in spite of distributed control 1974 584pubTripreport E.W.Dijkstra, Poland and USSR, 4-25 September 1976 1982 722 A book review for the IBM Systems Journal 1979 137 Heel kort verslag bezoek aan het symposium over Multi Access Computers, 2-4 november 427 Speech at the occasion of an anniversary 1974 585 Tripreport E.W.Dijkstra, Tokyo, 28 Sep.—3 Oct. 1976 1976 723 On W.H.J.Feijen’s solution for the lexicographic minimum of a circular list 1979 1965 in het NPL 1965 427pubSpeech at the occasion of an anniversary 1982 585pubTripreport E.W.Dijkstra, Tokyo, 28 Sep. - 3 Oct. 1976 1982 724 Een gotspe 1980 139 Appreciatie van ponskaarten n.d. 428 Array variables 586 Tweede toespraak tot mijn studenten, najaar 1976 1976 724E A chutspa 1980 140 Documentatie over de communicatie apparatuur aan de EL X8 n.d. 429 A generalization of the Sheffer Stroke for n-valued logic (by C.S.Scholten)n.d. 587 Derde toespraak tot mijn studenten, najaar 1976 1976 725 Trip report E.W.Dijkstra, Liege, Nov.-Dec.1979 1980 145 Globale beschrijving van de drijvende arithmetiek van de EL X8 1965 432 [A letter to C.A.R. Hoare, 13 July 1974] 1974 588 Vierde toespraak tot mijn studenten, najaar 1976 1976 726 How Dutch Informatics fell between two chairs 1980 147 Proposal for the input and the notation of the systemn.d. 435 Associons: an effort towards accomodating potentially ultra-high concurrency (with W.H.J.Feijen 589 Vijfde toespraak tot mijn studenten, najaar 1976 1976 727 Trip report E.W.Dijkstra, U.S.A. 12 Jan. - 2 Feb. 1980 1980 149 Documentatie over de communicatieapparatuur aan de EL X8 (vervanging van EWD140) 1966 and M.Rem) 590 A first investigation of the crossflow computer 1976 728 A problem solved by Netty van Gasteren and me 1980 150 Tentamenopgave “Cooperating Sequential Processes” n.d. 439 Associons continued (with W.H.J.Feijen and M.Rem) 591 The problem of the maximum length of an ascending subsequence 1976 729 On well-shaped mathematical arguments 1980 155 Context dependent names n.d. 441 The problem of the shortest subspanning tree 592 A small note on the additive composition of variant functions 1976 730 On two types of infinite sets of infinite sequences (by the Tuesday Afternoon Club) 1980 157 Over de sequentiele interpretatie van een ponsband n.d. 442 Inside “Mathematics Inc” 1974 593 Zesde toespraak tot mijn studenten, najaar 1976 1976 731 An experiment in mathematical exposition 1980 158 Tentamenopgave “Cooperating Sequential Processes” (april 1966) 19656 442pubInside “Mathematics Inc” 1982 594 A parable 1976 732 The teachability of mathematical thinking (Draft contribution to “Mathematics Tomorrow”)1980 161 Sequentiele interpretatie van ponsband n.d. 443 A multidisciplinary approach to mathematics 1974 594pubA parable 1982 733 Naar aanleiding van “Experimentele post-propadeuse opleiding voor informatica-ingenieur aan de 163 Eerste verkenning over de dood van programma’s n.d. 443pubA multidisciplinary approach to mathematics 1982 595 On-the-fly garbage collection: an exercise in cooperation (with Leslie Lamport, A.J.Martin, THE’’ (Eindhoven februari 1980 SOO/jc/sdb) 1980 164 Keuze tussen symcharf en symchart n.d. 445 The problem of the convex hull in three dimensions C.S.Scholten, E.F.M.Steffens) 1977 734 The superfluity of the general semaphore 1980 167 Aan de leden van de onderafdelingsvergadering n.d. 447 On the role of scientific thought 1974 596 “On a problem from Aho, Hopcroft, and Ullman” 1976 735 A mild variant of Combinatory Logic1980 184 Ir.Medema, Ir.Hendriks, weledelgestrenge heren! n.d. 447pubOn the role of scientific thought 1982 596a Tripreport E.W.Dijkstra, Copenhagen 10-12 Nov. 1976 1976 736 Recording the structure of trees in their leaves 1980 188 Over een academische opleiding tot “Computer Scientist” n.d. 448 Trip report E.W.Dijkstra, Edinburgh and Newcastle, 1 - 6 September 1974 1974 597 Yet another note about termination 1976 737 A notational alternative for quantification 1980 190 Tentamen “Co-operating Sequential Processes” n.d. 449 Het curriculum informatica aan de THE n.d. 598 A bug in my book! 1976 738 More mathematical folklore 1980 191 Aan de Commissie Wetenschapsbeleid ter zake van Automatiseringswiskunde aan de THE 1967 450 Correctness concerns and, among other things, why they are resented 1974 599 Achtste toespraak tot mijn studenten, najaar 1976 1976 739 A somewhat open letter to the Editor-in-Chief of Acta Informatica 1980 191a Aan de Commissie Wetenschapsbeleid ter zake van Automatiseringswiskunde aan de THE 451 Heer, verlos ons van de charlatans! n.d. 600 A sequel to EWD592 1977 740 A short proof of one of Fermat’s theorems 1980 194 Het einde van een ambacht n.d. 452 About robustness and the like1975 601 Tripreport E.W.Dijkstra, Munich 24—26 November 1976 1976 741 Partitioning the edges of the complete graphs into trees or cycles 196 The structure of the “THE”-multiprogramming system 1968 454 [Letter to Dr. H.Bekic, 8 October 1974] 1974 602 Comments on Arbeitsblatt 3 from o.Prof.Dr.F.L.Bauer (with C.S.Scholten)603 Tripreport (by the Tuesday Afternoon Club) 1980 196pubThe structure of the “THE”-multiprogramming system 1968 456 Determinism and recursion versus non-determinism and the transitive closure 1974 E.W.Dijkstra, St.Pierre-de-Chartreuse, 12-19 Dec.1976 1976 742 A sequel to EWD740 1980 198 An effort towards structuring of programmed processes n.d. 462 A time-wise hierarchy imposed upon the use of a two-level store 1974 603pubTripreport E.W.Dijkstra, St.Pierre-de-Chartreuse, 12-19 Dec.1976 1982 743 A new policy for Mathematics Inc.? 1980 200 The variable size machine 1967 462pubA time-wise hierarchy imposed upon the use of a two-level store 1982 604 Paying logical conscience-money to the fair demon 1977 744 A short note on symmetric distributed arbitration 1980 201 A sequel to EWD200 1967 463 Some questions 1974 605 Tripreport E.W.Dijkstra, Columbus - Pittsburgh - Paoli, 12-22 January 1977 1977 745 Trip report E.W.Dijkstra, Los Angeles, Austin (Texas), and Portland, 6-28 August 1980 1980 206 A sequel to EWD201 1967 464 A new elephant built from mosquitos humming in harmony 1974 606 Eerste toespraak tot mijn studenten, voorjaar 1977 1977 746 Trip report E.W.Dijkstra, Newcastle-upon-Tyne, 1-5 Sep. 1980 1980 209 A constructive approach to the problem of program correctness 1967 464pubA new elephant built from mosquitos humming in harmony 1982 607 A correctness proof for communicating processes: a small exercise 1977 747 Comments on MIL-STD-1862, 28 May 1980 1980 209A A constructive approach to the problem of program correctness 1968 465 Monotonic replacement algorithms and their implementation 1974 607pubA correctness proof for communicating processes: a small exercise 1982 748 A somewhat open letter to Wladislaw M.Turski 1980 209Apub A constructive approach to the problem of program correctness 1968 465pubMonotonic replacement algorithms and their implementation 1982 608 An elephant inspired by the Dutch National Flag 1977 749 On the productivity of recursive definitions 1980 214 ACM Symposium in Gatlinburg “Operating System Principles” n.d. 466 Trip report E.W.Dijkstra, Meeting IFIP W.G.2.3., Munich, 8—14 December 1974 1974 608pubAn elephant inspired by the Dutch National Flag 1982 750 American programming’s plight 1980 215 A case against the GO TO statement 1968 466pubTrip report E.W.Dijkstra, Meeting IFIP W.G.2.3., Munich, 8-14 December 1974 1982 609 Tweede toespraak tot mijn studenten, voorjaar 1977 1977 751 Mainly on the omission of parentheses 1980 215pub Go To statement considered harmful 1968 469 Programming methodologies, their objectives and their nature n.d. 752 Distributed Arbitration (DRAFT, with C.S.Scholten 221 [Raw code for computing De Bruijn-sequences] n.d. 469pubProgramming methodologies, their objectives and their nature n.d. 753 On a theorem by Lambek and Moser 1980 470 Letter to the referees of EWD418 1975 222 Verslag van het bezoek aan Grenoble en Parijs (6-11 december 1967) 1967 471 Bij de aanvang van het semester n.d. 611 On the fact that the Atlantic Ocean has two sides 1977 754 An error in EWD744 1980 224 HEEL VERTROUWELIJK 1968 472 Guarded commands, non-determinacy and formal derivation of programs 1975 611pubOn the fact that the Atlantic Ocean has two sides 1982 755 Very elementary number theory redone 1980 227 Stepwise program construction 1968 472pubGuarded commands, non-determinacy and formal derivation of programs 1975 612 Derde toespraak tot mijn studenten, voorjaar 1977 1977 756 A postscript to EWD755 1980 227pub Stepwise program construction 1982 473 On the teaching of programming, i.e. on the teaching of thinking 1975 613 Tripreport E.W.Dijkstra, Australia, 16 February 1977 - 21 March 1977 1977 757 A misguided educational effort 1980 229 Aan de leden van de Commissie Wetenschapsbeleid 1968 474 Trip report visit ETH Zurich, 3—4 February 1975 by E.W.Dijkstra 1975 613pubTripreport E.W.Dijkstra, Australia, 16 February 1977 - 21 March 1977 1982 758 An intriguing example 1980 230 To the EDITOR ALGOL 68 n.d. 474pubTrip report visit ETH Zurich, 3-4 February 1975 by E.W.Dijkstra 1982 614 A somewhat open letter to EAA or: why I proved the boundedness of the non-determinacy in the 759 A somewhat open letter to D.A.Turner 1980 231 De Rekenautomaat als Gebruiksvoorwerp 1968 475 A letter to my old friend Jonathan 1975 way I did 1977 760 A somewhat open letter to F.Kroeger 1980 232 Pretentie en doelstelling van het THE multiprogrammeringsproject n.d. 475pubA letter to my old friend Jonathan 1982 614pubA somewhat open letter to EAA or: why I proved the boundedness of the non-determinacy in the 761 Een kanttekening 1980 235 Contractie en expansie 1968 476 Concurrent programming: a preliminary investigation 1975 way I did 1982 762 We mathematicians are losing the race 1980 236 Complexity controlled by hierarchical ordering of function and variability n.d. 477 Tweede toespraak tot mijn studenten n.d. 615 Vierde toespraak tot mijn studenten, voorjaar 1977 1977 763 A proof by Rutger M.Dijkstra and me 1980 237 A preliminary investigation into Computer Assisted Programming n.d. 478 On one-sided smoothing of event sequences 1975 616 Vijfde toespraak tot mijn studenten, voorjaar 1977 1977 764 Repaying our debts 1980 238 Computation versus program n.d. 479 Commentaar op “Structuurplan Informatica (W.O.)” van de ARSI 1975 617 Zesde toespraak tot mijn studenten, voorjaar 1977 1977 765 A Hungarian problem 1980 239 On trading storage against computation time n.d. 480 “Craftsman or scientist?” 1975 618 On Webster, users, bugs and Aristotle 1977 766 An educational stupidity 1980 240 The moral of EWD237 - EWD239 n.d. 480pub“Craftsman or Scientist?” 1982 618pubOn Webster, users, bugs and Aristotle 1982 767 A.J.Martin’s solution of the Hungarian problem 1980 241 Towards correct programs n.d. 481 Derde toespraak tot mijn studenten 1975 619 Essays on the nature and role of mathematical elegance (1) 1977 768 Largely on nomenclature 1981 243 Bijdrage voor de subcommissie Aanschaffingsbeleid Rekenautomaten 1968 482 Exercises in making programs robust1975 620 Zevende toespraak tot mijn studenten, voorjaar 1977 1977 770 D.A.Turner’s reply 1980 244 Een educatief dilemma 1968 482pubExercises in making programs robust 1982 621 Achtste toespraak tot mijn studenten, voorjaar 1977 1977 771 About 2-coloured 6-graphs 1980 245 On useful structuring n.d. 483 Vierde toespraak tot mijn studenten 1975 622 On making solutions more and more fine-grained (In gratitude dedicated to C.A.R.Hoare, 772 A methodological sequel to EWD771 1980 246 Verslag van het bezoek aan de NATO Conference on Software Engineering n.d. 484 Tripreport E.W.Dijkstra, London, 9 - 10 March 1975 1975 D.E.Knuth, and J.F.Traub.) 1977 773 Trip report E.W.Dijkstra, Han-sur-Lesse, 7-12 Jan. 1981 1981 247 [“Journal for half-baked Ideas”] n.d. 485 Marketing questionnaire “A Discipline of Programming” 1975 622pubOn making solutions more and more fine-grained (In gratitude dedicated to C.A.R.Hoare, 774 Trip report E.W.Dijkstra, California, 17-31 January 1981 1981 247a [Beantwoording ener enquete] n.d. 486 Vijfde toespraak tot mijn studenten n.d. D.E.Knuth, and J.F.Traub.) 1982 775 On Kleinrock’s Theorem 1981 249 Notes on Structured Programming 1970 487 Letter to the Burroughs recipients of the EWD-series 1975 623 The mathematics behind the Banker’s Algorithm 1977 776 Lambek and Moser revisited 1981 251 Requirements of programming tools n.d. 489 Zesde toespraak tot mijn studenten 1975 623pubThe mathematics behind the Banker’s Algorithm 1982 777 A word of welcome (Draft) 1981 252 Mijn laatste verslag van een bijeenkomst van W.G.2.1. n.d. 492 On-the-fly garbage collection: an exercise in multiprocessing 1975 624 Stationary behaviour of some ternary networks 1977 778 A somewhat open letter to Nils J.Nilsson 1981 252a Ontwerp voorwoord [afstudeerrichting Fundamentele Programmering] n.d. 493 [Toespraak tot een afstudeerder] n.d. 625 Two starvation-free solutions of a general exclusion problem 1977 779 An assertional proof of a program by G.L.Peterson 1981 253 Tentamen Co-operating Sequential Processes (jan. 1969) 1969 494a Zevende toespraak tot mijn studenten 1975 626 WASSERMAN, Antony I. en Peter FREEMAN (Eds.). Software Engineering Education. Needs and 780 Proving the existence of the Euler line (with A.J.M. van Gasteren) 253a Ontwerp Collegebeschrijving “Inleiding tot de kunst van het programmeren’’ n.d. 494 Trip report E.W.Dijkstra 16th April/7th May, U.S.A. and Canada 1975 Objectives. Proceedings of an Interface Workshop. New York/Heidelberg/Berlin. Springer- 781 About the presentation of programs (with A.J.M. van Gasteren)782A stupid notation 1981 254 Computer Science of enkel Software Engineering? n.d. 494pubTrip report E.W.Dijkstra 16th April/7th May, U.S.A. and Canada 1982 Verlag, 1976. 1977 783 The administration as social disease 1981 254a Hoger orde adressering n.d. 495 Achtste toespraak tot mijn studenten 1975 627 A position paper on Software Reliability 1977 784 My mother’s contribution to Honsberger’s collection 1981 255 Over de IBM360 n.d. 496A On-the-fly garbage collection: an exercise in cooperation (preliminary version) 628 Naar aanleiding van een eigenlijk wat beledigend stukje 1977 785 Our presentation of K.A.Post’s proof of R.Stanley’s theorem (with A.J.M. van Gasteren)786 257 Verslag bezoek aan MIT 1969 (with Leslie Lamport, A.J.Martin, C.S.Scholten, and E.F.M.Steffens)1975 629 On two beautiful solutions designed by Martin Rem 1977 Trip report E.W.Dijkstra, England, 23 April 1981 1981 259 Toekomstverwachting Fundamentele Programmering n.d. 496B On-the-fly garbage collection: an exercise in cooperation (with Leslie Lamport, 629pubOn two beautiful solutions designed by Martin Rem 1982 786a Sets are Unibags 1981 260 Plotting a curve with a printern.d. A.J.Martin, C.S.Scholten, and E.F.M.Steffens) 1975 630 On-the-fly garbage collection: an exercise in cooperation (with L. Lamport, A.J. Martin, 787 A (new?) proof of a theorem of Euler’s on partitions1981 261 Hoe wiskundig programmeren is n.d. 496BpubOn-the-fly garbage collection: an exercise in cooperation 1978 C.S.Scholten, E.F.M. Steffens)631 Re: “Formal derivation of strongly correct parallel 788 What we seem to have learned (with A.J.M. van Gasteren)789 264 On understanding programs n.d. 497 A challenge to memory designers? 1975 programs’’ by Axel van Lamsweerde and M.Sintzoff 1977 A minor improvement of Heapsort 1981 267 Over de toekomst van Computer Science n.d. 497a Remarks prompted by Alfonso F. Cardenas 633 Tripreport E.W.Dijkstra, 29 July - 21 August 1977 1977 789a A minor improvement of Heapsort 1981 268 Structured programming 1969 498 How do we tell truths that might hurt? 1975 634 Position paper on the impact of microprocessors (IFIP77) 1977 789b A minor improvement of Heapsort 1981 270 Aan de keuzecommissie rekenmachine n.d. 498pubHow do we tell truths that might hurt? 1982 635 Tripreport E.W.Dijkstra, Newcastle-upon-Tyne, 5-10 Sept. 1977 1977 790 Trip report E.W.Dijkstra, Muenchen, 19 May 1981 1981 272 Verslag van de tweede “Conference on Software Engineering”, georganiseerd door de 499 [toespraak tot een student bij uitreiking ir-diploma] n.d. 635pubTripreport E.W.Dijkstra, Newcastle-upon-Tyne, 5-10 Sept. 1977 1982 791 The psychology of the user 1981 NATO Science Committee te Rome, 27 - 31 oktober 1969 n.d. 500 After many a sobering experience 1975 636 Why naive program transformation systems are unlikely to work 1977 792 Hamming’s exercise in SASL1981 273 The programming task considered as an intellectual challenge 1969 501 Variations on a theme: an open letter to C.A.R. Hoare 1975 636pubWhy naive program transformation systems are unlikely to work 1982 793 The analysis of a two-person game 1981 275 Structure of an extendable operating system 1969 501pubVariations on a theme: an open letter to C.A.R. Hoare 1982 637 The Three Golden Rules for Successful Scientific Research 1977 794 Heapsort (with A.J.M. van Gasteren and W.H.J.Feijen)795 278 Organisatie van onderzoek en onderwijs van Fundamentele Programmering 1969 502 On a gauntlet thrown by David Gries 1975 637pubThe Three Golden Rules for Successful Scientific Research 1982 An alternative to heapsort for sorting in situ 1981 279 The programming laboratory project n.d. 503 A post-scriptum to EWD501 1975 638 A political pamphlet from the Middle Ages 1977 796 Smoothsort, an alternative for sorting in situ 1981 281 Aan de Commissie Wetenschapsbeleid n.d. 503pubA post-scriptum to EWD501 1982 639 The introduction of MAES(R) 1977 796a Smoothsort, an alternative for sorting in situ 1981 282 A tree-structured system n.d. 504 Erratum and embellishments of EWD503 1975 639pubThe introduction of MAES(R) 1982 797 Fibonacci numbers and Leonardo numbers 1981 286 Verslag van mijn reis naar California 1970 504pubErratum and embellishments of EWD503 1982 640 Finding the correctness proof of a concurrent program 1977 798 Trip report E.W.Dijkstra, Newcastle, 19-25 July 1981 1981 287 Sans titre (but most definitely a predecessor to EWD316, “A short introduction into the 506 Tripreport E.W.Dijkstra: NATO Summer School Marktoberdorf 1975 1975 640apubFinding the correctness proof of a concurrent program 1977 799 Trip report E.W.Dijkstra, Marktoberdorf, 26/7-10/8/81 1981 art of programming’’) n.d. 507 On a gauntlet thrown by David Gries 1975 641 On the interplay between mathematics and programming 1977 800 A bagatelle for the left hand 1982 288 Concern for correctness as a guiding principle for program construction 1970 508 A synthesis emerging? 1975 642 A special sorting elephant 1977 801 Distances from the root in skew trees (with C.S.Scholten)802 288a Recensie voor het tijdschrift “Informatie” 1970 508pubA synthesis emerging? 1982 643 A class of simple communication patterns (with C.S.Scholten)643pub Trip report E.W.Dijkstra, Scotland, Newcastle 31 Aug.-15 Sep. 1981 1981 292 Letter to professor C.A.R. Hoare (31 August 1970) 1970 509 Eerste toespraak, najaar 1975 1975 A class of simple communication patterns 1982 803 Lecture notes on the structure of programs and proofs 1981 295 Reisverslag van bezoek aan het Seminar on the Teaching of Programming at University Level n.d. 511 Tripreport E.W.Dijkstra W.G.2.3, Baden, 1 - 5 September 1975 1975 644 Letter to J. Arsac 1977 804 On equality of propositions 1981 298 Informatica als wiskundige discipline n.d. 512 Comments at a symposium 1975 645 Tripreport E.W.Dijkstra, USA 19-30 October 1977 1977 805 Trip report E.W.Dijkstra, Amsterdam, 26-29 Oct. 1981 1981 300 Exit “The Programming Laboratory” n.d. 512pubComments at a symposium 1982 646 A not so simple theorem about undirected graphs 1977 806 Trip report E.W.Dijkstra, USA, 1-27 Nov. 1981 1981 302 Design considerations in more detail n.d. 513 Tripreport E.W.Dijkstra Newcastle, 8-12 September 1975 1975 647 Commentaar op een ontwikkeling binnen de TH’s 1977 807 The Fast Fourier Transform and the Perfect Shuffle 1982 303 On the reliability of programsn.d. 513pubTripreport E.W.Dijkstra Newcastle, 8-12 September 1975 1982 648 “Why is software so expensive?” An explanation to the hardware designer 1977 808 Canonical string reduction 1981 306 Over het gewicht van een informatica-opleiding 1971 514 On a language proposal for the Department of Defense 1975 648pub“Why is software so expensive?” An explanation to the hardware designer 1982 809 An introductory essay on three algorithms for sorting in situ (with A.J.M. van Gasteren)810 307 (over een voorgestelde configuratie van een P1400 en vier P880’s) n.d. 515 Tweede toespraak, najaar 1975 1975 649 A supplement to EWD591 “The problem of the maximum length of an Fast image construction in computerized axial tomography (CAT) (with A.J.M. van 308 Reisverslag bezoek van E.W.Dijkstra aan IFIP W.G.2.3 te Warwick, Engeland n.d. 516 Derde toespraak, najaar 1975 1975 ascending subsequence’’ 1977 Gasteren) 309 (over een voorgestelde configuratie van een P1400 en vier P880’s) 1971 518 Vierde toespraak, najaar 19751975 650 A theorem about odd powers of odd integers 1977 810a Fast image construction in computerized axial tomography (CAT) (with A.J.M. van Gasteren)811 310 Hierarchical ordering of sequential processes n.d. 520 On-the-fly garbage collection: an exercise in cooperation (with Leslie Lamport, 650pubA theorem about odd powers of odd integers 1982 An alternative ending for AvG16/ EWD809 1982 310pubHierarchical ordering of sequential processes n.d. A.J.Martin, C.S.Scholten, E.F.M.Steffens) 1975 651 A strong P/V-implementation of conditional critical regions 1977 812 A personal summary of Jonkers’s program transformation 1982 311 [Review of] Bauer, Goos: “Informatik, Erster Teil” Heidelberger Taschenbuecher, Band 80 521 Vijfde toespraak, najaar 1975 1975 652 A correction on EWD651 1978 813 About predicate transformers in general (with C.S.Scholten) Springer Verlag, 1971 1971 522 Zesde toespraak, najaar 1975 1975 653 Exploiting contiguity in a linear store1978 814 A review of a book on PEARL 1982 312 Verslag van reis van E.W.Dijkstra naar Noord Amerika 1971 523 Zevende toespraak, najaar 1975 1975 654 In honour of Fibonacci 1978 815 Remarks on notation (with A.J.M. van Gasteren)816Weakest preconditions, liberal and not (with 315 De ontwikkeling van een ontwerpmethodologie 524 Review of “On the Feasibility of Software Certification” 1975 655 Essays on the nature and role of mathematical elegance (3) (A sequel to EWD619) 1978 C.S.Scholten) 316A Reisverslag van Edsger W.Dijkstra aan Summer School Marktoberdorf, juli 1971 1971 525 On a warning from E.A.Hauck 1975 656 An introduction to implementation issues 1978 817 An introduction to three algorithms for sorting in situ (with A.J.M. van Gasteren) 316 A short introduction to the art of programming 1971 525pubOn a warning from E.A.Hauck 1982 657 On leaves and nodes: a simplification of EWD653 1978 817a An introduction to three algorithms for sorting in situ (with A.J.M. van Gasteren) 317 On a methodology of design n.d. 526 Comments on “Woodenman” HOL Requirements for the DoD 1975 658 On language constraints enforceable by translators 817pubAn introduction to three algorithms for sorting in situ 1982 319 A class of allocation strategies inducing bounded delays only 1972 527 On units of consistency 1975 (An open letter to Lt.Col. William A.Whitaker) 1978 818 A nice theorem on monotonic predicate sequences 1982 325 Poging tot plaatsbepaling van de Informatica1972 528 More on Hauck’s warning 1975 659 On the BLUE Language submitted to DoD 1978 819 Mathematical induction and computing science 1982 329 Information streams sharing a finite buffer 1972 528pubMore on Hauck’s warning 1982 660 On the GREEN Language submitted to the DoD 1978 819pubMathematical induction and computing science 1982 329pubInformation streams sharing a finite buffer 1972 529 Achtste toespraak, najaar 1975 1975 661 On the RED Language submitted to the DoD 1978 820 On iteration and recursion 1982 330 [Book review of: Bauer-Goos, Informatik, Zweiter Teil] 1972 530 Negende toespraak, najaar 1975 1975 662 On the YELLOW Language submitted to the DoD 1978 821 From predicate transformers to predicates (Dedicated by the Tuesday Afternoon Club to C.A.R. 338 Parallelism in multi-record transactions (with C.S.Scholten)1972 531 Tiende toespraak, najaar 1975 1975 663 The summing-up 1978 Hoare at the occasion of his being elected Fellow of the Royal Society.) 1982 338pubParallelism in multi-record transactions 1972 532 An open letter to L.Bass 1975 664 What should “strongly typed” mean? 822 A summary of formulae (and of some theory) 1982 340 The humble programmer 1972 533 HOMO COGITANS 1975 665 Trip report E.W.Dijkstra, U.K. - Bahamas - U.S.A., 11-30 April 1978 1978 823 A sequel to EWD822 (with C.S.Scholten) 340pubThe humble programmer 1972 534 Elfde toespraak, najaar 1975 1975 666 A problem solved in my head 1978 824 Linearization of a two-dimensional search 1982 341 [Toespraak over de noodzaak van programmeermethodologie] n.d. 535 An answer to Jack Mazola 1975 667 On the foolishness of “natural language programming” 1978 825 About the correctness of a few SASL programs 1982 343 Reisverslag betreffende het bezoek aan de USA van 14 tot 30 mei 1972 door E.W.Dijkstra 1972 536 A sequel to EWD535 1975 668 On the correctness of a design by Alain J.Martin 1978 826 Trip report E.W.Dijkstra, USA, 20 May 1982 - 14 June 1982 1982 345 Ter zake van wiskundige modelvorming 1972 537 Twaalfde toespraak, najaar 1975 1975 669 A book review1978 827 A very simple exercise in SASL 1982 348 Verslag van de reis van E.W.Dijkstra naar Boston, 12 - 18 augustus 1972 1972 538 A collection of beautiful proofs 1975 670 Sequencing and the discriminated union 1978 828 Distributed termination detection revisited 1982 349 Ontwikkelingsplan Informatica 1972 538pubA collection of beautiful proofs 1982 671 Program inversion 1978 829 De software crisis, ontstaan en hardnekkigheid 1982 351 Verslag bezoek Engeland 30 augustus - 9 september 1972 1972 539 Mathematics Inc., a private letter from its chairman 1975 671pubProgram inversion 1982 830 On different notions of termination (with C.S.Scholten) 353 Elementen ener afstudeerrichting in de informatica 1972 539pubMathematics Inc., a private letter from its Chairman 1982 672 More on A.J.Martin’s design (A sequel to EWD668)1978 831 Why numbering should start at zero 1982 361 Programming as a discipline of mathematical nature1973 540 Two views of programming 1975 673 On weak and strong termination 1978 832 A theorem about infinite sequences of numbers 1982 361pubProgramming as a discipline of mathematical nature1974 541 Dertiende en laatste toespraak, najaar 1975 1975 673pubOn weak and strong termination 1982 833 An In-Depth Seminar on Proven Tools & Techniques of Structured Methodology for Effective 362 Bezoek van E.W.Dijkstra aan l’Alpe d’Huez, 8—15 december 1972 1972 542 [Toespraak tot twee afstudeerders] 1975 674 Tripreport E.W.Dijkstra, Zuerich, 2-7 July 1978 1978 Software Configuration Management1982 363 Reisverslag E.W.Dijkstra: Open house on semantics, Aarhus, 7 - 18 jan. 1973 1973 543 Eerste toespraak tot mijn studenten, voorjaar 1976 1975 675 The equivalence of bounded nondeterminacy and continuity 1978 834 Elementary predicates and elimination (with A.J.M. van Gasteren) 364 Weledelgestrenge Heer, Ingenieur Swinkels n.d. 544 An open letter to Ross Honsberger 1975 675pubThe equivalence of bounded nondeterminacy and continuity 1982 835 Lecture notes “Predicate transformers”(Draft) 1982 365 A parabel n.d. 547 Tripreport E.W.Dijkstra, England and USA, 3-26 January 1976 1976 676 Tripreport E.W.Dijkstra, Marktoberdorf 24 July - 6 August 1978 1978 836 A note on substitution and renaming 1982 366 Waarom ik niet gewoon hoogleraar wil blijven n.d. 548 Tweede toespraak tot mijn studenten, voorjaar 1976 1976 677 On one of Cayley’s theorems 1978 837 Trip report E.W.Dijkstra, Newcastle-upon Tyne, 6-10 Sep. 1982 1982 367 On the axiomatic definition of semantics 1973 549 Derde toespraak tot mijn studenten, voorjaar 1976 1976 678 A story that starts with a very good computer 1978 838 Trip report E.W.Dijkstra, Copenhagen, 10-16 Sep. 1982 1982 368 Verslag van bezoek aan Washington, maart 1973 1973 550 A more formal treatment of a less simple example 1976 678pubA story that starts with a very good computer 1982 839 Trip report E.W.Dijkstra, Utrecht 30 Sep.-1 Oct. 1982 1982 372 A simple axiomatic basis for programming language constructs 1973 551 Vierde toespraak tot mijn studenten, voorjaar 1976 1976 679 Tripreport E.W.Dijkstra, Newcastle-London-Lancaster, 4-13 Sep. 1978 1978 840 Derivation of a termination detection algorithm for distributed computations (with W.H.J.Feijen and 374 The analysis of multiprogrammed systems of unspecified degree of parallellism 1973 552 Vijfde toespraak tot mijn studenten, voorjaar 1976 1976 680 A book review1978 A.J.M. van Gasteren) 1982 375 A non algebraic example of a constructive correctness proof 1973 553 On a gauntlet thrown by David Gries 1976 682 The nature of Computer Science (first draft) 1978 840pubDerivation of a termination detection algorithm for distributed computations 1983 The EWDs continued 841 “There is no ‘royal road’ to geometry” 1982 1002pubThe calculus of boolean structures (Part 1) 1990 1181 Don’t mix unary pre- and postfix operators 1994 841a [Reflections on “A note on two problems in connexion with graphs’’ 1982 1003 Graphs of modest diameter and degrees 1987 1182 Counting characters 1994 841aPubA note on two problems in connexion with graphs. 1959 1004 A methodological remark on mathematical induction 1987 1183 “Less than” in terms of “at most” 1994 842 Two cheers for equivalence 1982 1005 A supplement to EWD1002 1987 1184 Our book’s omission on quantification over scalar subtypes 1994 843 A short sequel to EWD842 1982 1006 Trip report E.W.Dijkstra, Stanford/Palo Alto, 26-29 March l987 1987 1185 Lifting, orders, and the Galois connection 1994 844 A universal quantification revisited (with C.S.Scholten)845 The Leibniz Society 1007 Addendum to EWD969 1987 1186 Ping-pong arguments and Leibniz’s principle 1994 845 McCarthy’s 91-function: an unfortunate paradigm 1982 1008 What computing science is about 1987 1187 Boolean connectives yield punctual expressions 1994 846 The maximum length of a segment satisfying a monotonic predicate 1009 On a somewhat disappointing correspondence 1987 1188 A problem from Zhendong Patrick Su (including an alternative solution by R.Boute 1994 (with A.J.M. van Gasteren) 1010 A much neglected mathematical object 1987 1189 Another ping-pong argument from Leibniz’s principle 1994 847 Trip report E.W.Dijkstra, Australia, 19 Jan.1983 - 12 Feb.1983 1983 1011 Introducing my fall 1987 course on Mathematical Methodology 1987 1190 Problem 10406 from The American Mathematical Monthly, Volume 101, 849 Junctivity of extreme solutions (with C.S.Scholten) 1012 “Real mathematicians don’t prove” 1988 Number 8 / October 1994 1994 849a Junctivity of extreme solutions (with C.S.Scholten) 1013 Position paper on “fairness” 1987 1191 Junctivity and massaging quantification 1994 850 Trip report E.W.Dijkstra, Helsinki, 1-4 March 1983 1983 1014 A monotonicity argument revisited 1987 1192 The very first beginnings of lattice theory 1994 851 Reducing control traffic in a distributed implementation of mutual exclusion 1983 1015 On a problem transmitted by Doug McIlroy 1987 1193 On arcs and angles 1994 851a Reducing control traffic in a distributed implementation of mutual exclusion 1983 1016 A computing scientist’s approach to a once-deep theorem of Sylvester’s 1988 1194 Z.P. Su’s second problem 1994 851b Reducing control traffic in a distributed implementation of mutual exclusion 1983 1017 Fillers at a YoP-institute 1987 1195 Another forced ping-pong argument?1995 852 Judging “HOS” from a distance 1983 1017pubFillers at a YoP-institute 1990 1196 Generators of extreme values 1995 852a Judging “HOS” from a distance 1983 1018 To the members of the Budget Council 1987 1197 A termination argument 1995 853 A correction of EWD851b 1983 1019 Another filler of the YoP Institute 1988 1198 Jan van de Snepscheut’s tiling problem 1995 853a Ingenieur Ebergen, Weledelgetrenge Heer 1983 1019pubFillers at a YoP-institute 1990 1199 A supplement to EWD1140 and EWD1171 1995 854 The fruits of misunderstanding 1983 1020 The derivation of a proof by J.C.S.P. van der Woude1988 1200 Only a matter of style? 1995 854pubThe fruits of misunderstanding 1983 1020pubThe derivation of a proof by J.C.S.P. van der Woude 1990 1201 Triggered by Wim Feijen’s treatment of “Exists Forall => Forall Exists’’ 1995 855 Trip report E.W.Dijkstra, Barcelona 5-7 June 1983 1983 1021 A symmetry in the sorting task 1988 1202 The complete (n + 1)-graph in n-dimensional space 1995 856 On maximizing a product 1983 1022 A bagatelle on implication’s transitivity 1988 1203 Primes once more (re Kac & Ulam) 1995 857 Generalizing an old formula 1983 1023 On triangles being nondegenerate 1988 1204 Complete DAGs 1995 858 Trip report E.W.Dijkstra, USA, 10 June-3 July 19831983 1024 A new science, from birth to maturity 1988 1205 A trip to Harvard Law School, 10-11 April 1995 1995 859 Semantics of recursive procedures (with C.S.Scholten 1024pubA new science, from birth to maturity 1988 1206 An unfortunate use of symbols 1995 860 A sequel to EWD859 (with C.S.Scholten) 1025 Ulrich Berger’s solution to the rectangle problem 1988 1207 A theorem about “factors” perhaps worth recording 1995 861 Research proposal: Our plans for the years to come (with A.J.M. van Gasteren) 1026 Trip report E.W.Dijkstra, Marktoberdorf 1988 1988 1208 A result of rabbit removal 1995 862 A sequence with |x[n]| = x[n-1] + x[n+1] has period 9 1983 1027 My methodological blunder with grid polygons 1988 1209 Why American Computing Science seems incurable 1995 863 Predicate calculus revisited 1983 1028 Euclid, Netty, and the prime numbers1988 1210 The non-unique node multiplicity 1995 864 The distributed snapshot of Chandy/Lamport/Misra 1983 1029 The linear search revisited (with W.H.J.Feijen) 1211a On some very binary patterns (dedicated to F.E.J. Kruseman Aretz)1995 864a The Distributed Snapshot of K.M.Chandy and L. Lamport 1983 1029pubThe linear search revisited 1989 1212 For the record: painting the sqared plane 1995 865 Trip report E.W.Dijkstra, Brasil & USA, 17 Oct.- 6 Nov. 1983 1983 1031 Ascending functions and The Welfare Crook 1988 1213 Introducing a course on calculi 1995 866 An analytical proof of the Butterfly Theorem 1983 1032 Decomposing an integer as sum of two squares 1988 1214 The marriage agency 1995 867 On IPW’s 1983 1033 Trip report E.W.Dijkstra, Zuerich, 15-20 Oct. 1988 1988 1215 Courtesy Dr. Birgit Schieder 1995 868 Computers and General Education: a position paper 1983 1034 Equivalence versus mutual implication; junctivity and monotonicity 1988 1216 The equation x: [x] 1995 869 Ter afsluiting van de “Inleiding tot de Kunst van het Programmeren’’ 1983 1036 On the cruelty of really teaching computing science 1988 1218 A few addenda to EWD1192 1995 870 My mother’s proof of the Butterfly Theorem (see EWD866) 1983 1037 Exploring the lexical coupling 1989 1219 “I have a proof that ....” 1995 871t Invariance and nondeterminacy 1984 1038 A bagatelle on total orders 1989 1220 Honors course “Mathematical Methodology”, Spring 1996 1996 871m Invariance and nondeterminacy 1984 1039 Seemingly on a problem transmitted by Bengt Jonsson 1989 1221b Calculational proof design; an experiment 1995 871pubPHInvariance and nondeterminacy 1985 1040 The majority vote according to J. Gutknecht 1989 1221a Points in the plane (unfinished) 1995 871pubRSInvariance and nondeterminacy 1984 1041 By way of introduction 1989 1222 Inspired by ~[x] equiv [~x] 1995 872 The little essay I could not write 1984 1041a Factorizing the factorial 1989 1223 WLOG, or the misery of the unordered pair 1995 873 Trip report E.W.Dijkstra, London and Colchester, 16-20 Jan. 1984 1984 1042 Once more the bichrome 3 x 7 grid (See EWD764) 1989 1224 Hm++, a new Professional Standard (From the desk of the 874 A miscellany of results (with C.S.Scholten) 1043 A few comments on “Computing as a discipline” 1989 chairman of the Board of Mathematics Inc.) 1995 875 Monotonicity and quantification 1984 1044 To hell with “meaningful identifiers”! 1989 1225 Misra’s weakest fair buffer 1995 876 De microprocessor als lollie 1984 1045 The problem of the difficult dartboard 1989 1226 A simple geometrical theorem I did not know 1995 877 Some useful formulae (with A.J.M. van Gasteren) 1984 1046 A tale of two winters 1989 1227 A somewhat open letter to David Gries 1996 878 A monotonicity argument (with A.J.M. van Gasteren) 1984 1047 A relational summary 1990 1228 Sylvester’s theorem used (see EWD1016) 1996 879 Trip report E.W.Dijkstra, London, 14-17 February 1984 1984 1048 ATAC’s proof of Scholten’s theorem 1989 1229 Nondeterministic construction of an arbitrary witness 1996 880 Why the importance of continuity seems to be overrated (with A.J.M. van Gasteren) 1984 1049 A somewhat open letter to Uri Leron 1989 1230 Three very little problems from Eindhoven 1996 880a Why the importance of continuity seems to be overrated (with A.J.M. van Gasteren) 1984 1050 On the design of a simple proof for Morley’s Theorem 1989 1231 The arithmetic and geometric means once more 1996 880b The termination theorem for unconstrained nondeterminacy (with A.J.M. van Gasteren) 1051 The next forty years 1989 1232 My simplest theorem 1996 881 A review of “The Evolution of Programs” 1984 1052 From the Hungarian Eotvos Competition, 1911 1989 1233 A hint from monotonicity? 1996 882 [Unfinished (Regularity Calculus)] 1053 Monochrome pairs in the three-coloured plane 1989 1234 A problem communicated by Laurens de Vries 1996 883 The operational interpretation of extreme solutions (with C.S. Scholten) 1984 1054 On hygiene, intellectual and otherwise 1989 1235 Een scheve schaats 1996 884 A sequel to EWD874 (with C.S. Scholten) 1984 1055c On covering a figure with diamonds 1989 1236 The wife-swapping couples once more (See EWD1103 and EWD1115) 1996 885 Trip report E.W.Dijkstra, Muenchen, 12-14 April 1984 1984 1055 On the problem of the calissons 1989 1237 Elegance and effective reasoning (Fall 1996)1996 886 A simple fix-point argument without the restriction to continuity (with A.J.M. van Gasteren) 1055A untitled (advice to a young scientist) 1989 1238 Foreword 1996 886a A simple fix-point argument without the restriction to continuity (with A.J.M. van Gasteren) 1056 Hoe onbelangkrijk het is of duikboten kunnen zwemmen 1989 1239 A first exploration of effective reasoning 1996 887 Trip report E.W.Dijkstra, USA, 23 April -10 May 1984 1984 1057 Andrei P. Ershov in Nuenen 1989 1240 A little bit of lattice theory 888 Trip report E.W.Dijkstra, Zuerich, 22-24 May 1984 1984 1058 In reply to comments 1989 1240a A little bit of lattice theory 1998 889 User-friendly Mathematics 1984 1059 0 Preface (Mathematical Methodology) 1989 1241 The transitive closure of a wellfounded relation 1996 891 Well-founded sets revisited 1984 1060 “Predicate Calculus and Program Semantics”, fall 1989 1989 1243 The next fifty years 1996 892 Trip report E.W.Dijkstra, London, 12-14 June 1984 1984 1061 Composition, lambda-calculus, and some more 1989 1243a The next fifty years 1996 893 Trip report E.W.Dijkstra, USA, 17—26 June 1984 1984 1062 On an exercise of Tony Hoare’s 1989 1244a The formula for sin.(alpha + beta) 1996 894 On partitioning predicates 1984 1063 An introductory example (Mathematical Methodology) 1989 1244 The formula for sin(alpha + beta) 1996 895 Trip report E.W.Dijkstra, Marktoberdorf, 30 July - 12 Aug. 1984 1984 1064 On the selection of dummies: a notational freedom 1989 1245 A kind of converse of Leibniz’s Principle 1996 896 On the nature of computing science 1984 1065 An example of how to lengthen formal proofs 1989 1246 Courtesy Rajeev Joshi1996 897 A formal program derivation for the record 1984 1066 Hungry? Have a byte .... 1989 1247 Beware of the empty range 1996 898 The threats to computing science 1984 1067 A very first introductory example (Mathematical Methodology) 1989 1248 Homework #1 (See EWD996) 1996 899 A review of a paper in AI 1984 1068 On the quality criteria for mathematical writing (Mathematical Methodology) 1989 1249 Andrew’s challenge once more (see EWD1247) 1996 900 Minsegsumtwodim 1984 1069 Fair gambling with a biased coin 1989 1250 The couples, the river, and the little boat 1996 900a Minsegsumtwodim 1984 1070 For brevity’s sake (Mathematical Methodology) 1989 1251 Two problems derived from Hugo Steinhaus 1996 901 A simple fix-point argument without the restriction to continuity (with A.J.M. van Gasteren) 1071a Making a fair roulette from a possibly biased coin 1989 1252 Convocation speech, December 8, 1996 1996 901a A simple fix-point argument without the restriction to continuity (with A.J.M. van Gasteren) 1071 Making a fair roulette from a possibly biased coin 1989 1253 Mathematical induction’s fixpoint 1996 902 The regularity calculus: a second trial 1984 1071pubMaking a fair roulette from a possibly biased coin 1990 1254 A sequel to EWD1241 and WF 233/AvG 141 1996 903 A short sequel to EWD863 1984 1072 On covering a figure with diamonds 1989 1255 Pruning the search tree 1997 904 A problem solved by my nephew Sybrand L. Dijkstra 1984 1073 How Computing Science created a new mathematical style 1990 1256 Mathematical Methodology, Spring 1997 1997 905 Mainly on our use of the predicate calculus (Draft Ch.2) 1985 1074 A generalization of R.S. Bird’s problem 1990 1257 Defining the greatest common divisor 1997 906 Trip report E.W.Dijkstra, Nuenen & London, 10 Dec.’84 - 10 Jan.’85 1985 1075 Constructing the proof of Vizing’s Theorem (with J.R. Rao)1990 1258a The ladder theorem 1997 907 Trip report E.W.Dijkstra, Netherlands, Austria, 23-31 Jan. 1985 1985 1076 From “Discrete Mathematics with Applications” by Susanna S. Epp 1990 1258 The ladder theorem 1997 908 Predicate transformers (Draft Ch.3) 1985 1077 Fibonacci and the greatest common divisor 1990 1260 The marked coins and the scale 1997 909 Trip report E.W.Dijkstra, Westboro-Boston, 14-17 Feb. 1985 1985 1078 Leibniz’s Principle (Mathematical Methodology) 1990 1261 The angle bisectors of a triangle 1997 910 Semantics of straight-line programs (Draft Chap.4) 1985 1079 Well-foundedness and the transitive closure (with A.J.M. van Gasteren) 1263 A correction to EWD1240 1997 910pubSemantics of straight-line programs (Draft Chap.4) 1990 1080 Well-foundedness and lexical coupling (with A.J.M. van Gasteren) 1990 1265 The theorem of de Ceva once more 1997 911 Trip report E.W.Dijkstra, Tulsa, 1-6 March 1985 1985 1081 Mathematical induction and universal quantification1990 1266a Proving an implication via its converse 1997 912 Extreme solutions of equations (Draft Ch.5) 1985 1082a Designing the proof of Vizing’s Theorem (with J.R. Rao) 1990 1267 On the determinant of the product of two square matrices 1997 913 On a cultural gap (Draft) 1985 1083 The balance and the coins 1990 1268 The Mathematical Divide 1997 914 The repetition (Draft Ch.6) 1985 1084 A logician’s anomaly or: Leibniz vindicated 1990 1269 A simple proof of Hall’s Theorem 1998 915 A sequel to EWD912, i.e. to Draft Ch.5 1985 1085 Proving the theorem of Menelaos 1990 1270 How closures could have been invented 1998 916 An improvement on EWD912 1985 1086 The everywhere operator once more 1990 1271 N cheers for determinants (N>>0) 1998 917 Another misguided effort 1985 1087 A conversion routine revisited 1991 1272 A Geometry Problem from “The Monthly”, March 1998 1998 918 A summary of a year’s impressions 1985 1088 A theorem communicated by Ken Calvert 1991 1273 On Dijkstra’s Lemma and Kruskal’s Algorithm 1998 920 Can computing science save the computer industry? 1985 1089 An Oxford sequel to EWD1047 1991 1274 For the record: Yossi Shiloach’s Algorithm 1998 921 A correction of EWD914-15 1985 1090 The design of a proof of equality (Mathematical Methodology) 1991 1276 The algebraic core of a propositional logic (with Rutger M. Dijkstra) 922 A belated proof of self-stabilization 1985 1091 More equality proofs with instantiated definitions (Mathematical Methodology) 1991 1277 Society’s role in mathematics 1998 922pubA belated proof of self-stabilization 1986 1092 Two ways of determining an expectation value 1991 1278 A calculational example 1998 923 Trip report E.W.Dijkstra, Ithaca, Newport, 30 May - 13 June 1985 1985 1093 Proving the equality of infinite sequences 1991 1279 A simple country dance for transitivity and shunting1998 923a Where is Russell’s “Paradox”? 1985 1094 The undeserved status of the pigeon-hole principle (Mathematical Methodology) 1991 1280a A formula is worth a thousand pictures (dedicated to Charles Antony Richard Hoare) 1999 924 On a cultural gap 1985 1095 Are “systems people” really necessary? 1991 1280 A tough experiment with the triangle calculus 1999 924pubOn a cultural gap 1986 1096 Potter’s proof of disjunction’s symmetry 1991 1281 An iteration for the k-th root with cubic convergence 1999 925 Trip report E.W.Dijkstra, London, 25-27 June 1985 1985 1097 The majority vote among three 1991 1282 On graphs whose nodes are Black or White 1999 926 A computer to think about 1985 1098 Guided by necessity 1991 1283 How “they” try to corrupt “us” 1999 927 The ATAC ( = Austin Tuesday Afternoon Club) 1985 1099 Inspired by Peter Auer’s proof 1991 1284 Computing Science: Achievements and Challenges 1999 928 On structures 1985 1100 The computing habit 1991 1285 To Cambridge by mistake (13-18 April 1999) 1999 929 A generalization of the functions head and tail (unfinished) 1985 1101 Triangles in graphs: a sharp bound 1991 1286 A partition theorem of Euler’s generalized 1999 930 For the record: the Linear Search 1985 1102 Why preorders are beautiful 1991 1287 Dear Tony, dearest Jill, and other people, dear or not1999 931 Concerning the equivalence 1985 1103 For the record: ETAC and the couples 1991 1288 Ulrich Berger’s argument rephrased 1999 932b Some simple lemmata on incremental sorting 1985 1104 So much for scientific visualization 1991 1289 A 2-colouring problem in the rational plane 1999 932 Some simple theorems on incremental sorting 1985 1105 For Bill Walker a sequel to EWD1099 1991 1290 Eliminating cascading carries 1999 932a The streamlining of the mathematical argument 1985 1106 Courtesy Apt, ETAC, Hoogerwoord, & Voermans 1991 1291 Courtesy Georg Cantor and Jayadev Misra 1999 932c The streamlining of the mathematical argument 1985 1107 On extreme solutions 1991 1292 When a symmetric operator distributes over (up) and (down) 1999 933 On a problem posed by M.R.Khalil (for the record) 1985 1108 Too much PSST in Texas 1991 1293 Constructing the Binary Search once more 1999 934 The Saddleback Search 1985 1109 Simplifying a proof in our book 1991 1294a Designing a calculational proof of Cantor’s theorem2000 935a For the record: Batcher’s Baffler 1985 1111 Triggered by Higman’s Lemma 1991 1295 On the transitive closure of a wellfounded relation 2000 935 For the record: Batcher’s Baffler 1985 1112 Why “up to equivalence” 1991 1296 On weighted means, geometric and arithmetic 2000 936 On anthropomorphism in science 1985 1113 A somewhat open letter to Ben Kuipers 1991 1296a On weighted means, geometric and arithmetic 2000 937 Correction and extension of EWD932b 1985 1114 Well-foundedness and the relational calculus1991 1297 Triggered by a high-school exercise 2000 938 To an anonymous referee of AvG45/EWD901 1985 1115 A manuscript for the Coahuila student chapter of the ACM 1991 1298 Under the spell of Leibniz’s Dream 2000 939 Incremental sorting once more 1985 1116 More pointless relational calculus: the transitive closure 1991 1299 On defining sets, suprema, and infima 2000 940 What I missed in Batcher’s Baffler (EWD935a-0) 1985 1117 Monotonic demonstranda and dummy introduction 1991 1300 The notational conventions I adopted, and why 2000 941 Rotating a linear array1985 1118 On a formula designed by Henk Doornbos 1991 1301 The river, the isles and the bridges 2000 942 The longest plateau and other stories 1985 1119 A correction of EWD1112 1991 1302 Once more bichrome triangles in complete graphs 2000 943 The problem of the Longest Ribbon 1985 1120 Manipulating mathematical macros 1991 1303 My recollections of operating system design 2001 944 The operation “trickle” 1985 1121 Covering rectangles with bars of length 3 1992 1304 The end of computing science? 2000 945 A simple theorem? 1985 1122 Interleaving is associative 1992 1305 Answers to questions from students of Software Engineering 2000 946 The proof of the pudding 1985 1123 The unification of three calculi 1992 1306a The chessboard covered with dominoes 2001 947 A letter to a typewriter manufacturer 1985 1124 On a proof of Kaplansky’s Theorem 1992 1307 An unavoidable case analysis 2001 948 Misra’s proof of Lamport’s mutual exclusion1985 1125 A summary for Turner’s class (An extract from EWD1107) 1992 1308 What led to “Notes on Structured Programming” 2001 949 On substitution, replacement, and the notion of a function 1986 1126 Who failed? 1992 1309a Zuckerman’s problem and the ETAC 2001 950 On notation (with A.J.M. van Gasteren)950a On notation (with A.J.M. van Gasteren) 1127 Referee’s report on “A transformational approach to specifying recovery in asynchronous 1310 Three trip reports rolled into one: 2001.04.16 - 2001.07.06 2001 951 Trip report E.W. Dijkstra, Europe, 13.12.1985 - 10.1.1986 1986 communicating systems’’ by Zhiming Liu & Mathai Joseph, University of Warwick. Paper No. 40 1311 Another look at a problem from Hugo Steinhaus 2001 952 Science fiction and science reality in computing 1986 1128 Mathematical induction synthesized 1992 1312 On disjoint binary numbers 2001 953 A heuristic explanation of Batchers’s Baffler 1986 1129 Why “heavy-weight” bits are unavoidable 1992 1313 The GCD and the minimum 2001 953a A heuristic explanation of Batchers’s Baffler 1986 1130 On the economy of doing mathematics 1992 1315 Indirect equality enriched (and a proof by Netty) 2001 953aPubA heuristic explanation of Batchers’s Baffler 1986 1131 Bulterman’s theorem on shortest tree 1992 1316 Philips and I: a few snapshots2001 954 Idempotence and reflexivity; associativity and transitivity; distribution and monotonicity 1986 1132 Introducing a course on the design and use of calculi 1992 1317 From van IJzeren’s correspondence to my aunt & uncle 2002 954aPubOn binary operators and their derived relations 1988 1133 A theorem of Scholten’s once more (see EWD1048)1992 954a On binary operators and their derived relations 1987 1134 The checkers problem told to me by M.O. Rabin 1992 955 Partitioning predicates and substitution; diabolical and angelical nondeterminism 1986 1135 The knight’s tour 1992 956 Address to my students 1986 1136 A comparison of relational proofs 1992 957 Partitioning predicates and punctual functions (see EWD955) 1986 1137 Computing the future? 1992 958 On naming (with A.J.M. van Gasteren)959 A short note on universal quantification 1986 1138 Total-order junctivity 1992 960 On a proof I learned from prof. dr. J. Haantjes 1986 1139 A relational bagatelle 1992 961 On the “quadrangular” inequalities 1986 1140 The arithmetic mean and the geometric mean 1992 962 Introducing a course on mathematical methodology 1986 1141 Notational considerations and the relational calculus1992 963 Visuals for BP’s Venture Research Conference 1986 1142 It is all distributivity 1992 964 Node degree and the size of disconnected subgraphs1986 1143 Some annotated proofs 1992 965 Ptolemaeus and Brahmagupta (or: Baffled by Symmetry) 1986 1144 More annotated proofs (a sequel to 1143) 1992 966 Management and Mathemetics 1986 1145 A somewhat open letter to Cathleen Synge Morawetz 1992 967 On finite models for the equivalence (with C.S.Scholten) 1146 The transitivity of the implication 1992 968 Trip report E.W.Dijkstra, Marktoberdorf, 29 July - 10 Aug l986 1986 1147 More on monotonic predicate transformers and the introduction of dummies (see EWD1117)1992 969 Extreme solutions of equations 1986 1148 A more disentangled characterization of extreme solutions 1992 970 F.L. Bauer’s Conjecture is F.L. Bauer’s Theorem 1986 1149 Perry Moerland’s proof of Carel Scholten’s theorem 1992 972 (E y :: (A x :: p.x.y)) => (A x :: (E y :: p.x.y)) 1986 1150 On the design of calculational proofs 1993 973 The cosine rule 1986 1151 A terrible Thursday 1993 974 The longer side is opposite to the greater angle 1986 1152 Het intellectuele gehalte van informatica 1993 975 On the theorem of Pythagoras 1986 1153 On bags and identical twins 1993 976 Who is your “target audience”? 1986 1154 A derivation of a proof by D. Zagier 1993 977 An address to my students (16.9.1986) 1986 1155a A prime is in at most 1 way the sum of 2 squares 1993 978 A sequel to EWD977 (18.9.1986) 1986 1155 A prime is in at most 1 way the sum of 2 squares 1993 979 A solution designed by A. Blokhuis 1986 1156 Voorwoord (voor jaarboek studievereniging UT) 1993 980 The strange case of The Pigeon-hole Principle 1986 1157 Introducing a course on program design and presentation 1993 981 Address to my students (23.9.1986) 1986 1158 A bagatelle on Euclid’s Algorithm 1993 982 Relational Calculus according to ATAC 1986 1159 A note on “tail invariants” 1993 983 How do we contribute? (30.9.1986) 1986 1160 How subtypes should enter the picture 1993 984 The study of a notion, viz. that of residue classes 1987 1161 How promiscuous are the French ? 1993 985 A supplement to EWD878 1986 1162 A detailed derivation of a very simple program 1993 986 Suppose they differ! 1986 1163 Transitivity as an (unexpected?) consequence 1993 987a On a class of graphs with modest diameter 1986 1164 A tentative axiomatization of ascending sequences 1993 987 On a class of graphs with modest diameter 1986 1165 There is still a war going on 1993 988 On the phenomenon of scientific disciplines 1986 1166 “From my Life” 1993 988a How experimental is computing science? 1986 1167 A regrettable cover 1993 989 Proving Gupta’s Theorem 1986 1168 On two equations that have the same extreme solution 1994 990 A theorem of Charles Babbage’s extended 1986 1169 An alternative of the ETAC to EWD1163 1994 991 Why Johnny can’t understand1986 1170 Equilateral triangles and rectangular grids 1994 992 Difficult is easy 1986 1171 The argument about the arithmetic mean and the geometric mean, heuristics included 1994 993 The nature of my research and why I do it 1986 1172 Pythagorean triples, or the design of a theorem 1994 994 J. Misra’s comment on EWD964 1987 1173 A theorem proved by John Segers 1994 995 On W.H.J.Feijen’s string equation 1986 1174 The heuristics of a proof by Jan L.A. van de Snepscheut and Richard S. Bird 1994 996 Courtesy A.J.M. van Gasteren, C.S.Scholten and J.G.Wiltink 1986 1174a Heuristics for a calculational proof 1994 997 Computing Science in the United Kingdom 1987 1175 The strengths of the academic enterprise 1994 998 Shmuel Safra’s version of termination detection 1987 1176 A chutzpah 1994 999 Our proof format 1987 1177 In Memoriam Jan L.A. van de Snepscheut 1994 1000 Twenty-eight years 1987 1178 On an argument by J.A. Carruth & J. Misra 1994 1001 The calculus of boolean structures (Part 0) 1987 1179 A sorry parade1994 1002 The calculus of boolean structures (Part 1) 1987 1180 Heuristics for a very simple Euclidean proof 1994