Edsger W. Dijkstra - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 98 from 98

2022

On the Reliability of ProgramsEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 359-370, ACM / Morgan & Claypool, 2022. [doi]

Self-stabilizing Systems in Spite of Distributed ControlEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 333-338, ACM / Morgan & Claypool, 2022. [doi]

On-the-Fly Garbage Collection: An Exercise in CooperationEdsger W. Dijkstra, Leslie Lamport, Alain J. Martin, Carel S. Scholten, Elisabeth F. M. Steffens. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 339-358, ACM / Morgan & Claypool, 2022. [doi]

Recursive ProgrammingEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 291-300, ACM / Morgan & Claypool, 2022. [doi]

The Humble ProgrammerEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 5-18, ACM / Morgan & Claypool, 2022. [doi]

Go To Statement Considered HarmfulEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 315-318, ACM / Morgan & Claypool, 2022. [doi]

The Structure of the "THE"-Multiprogramming SystemEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 319-332, ACM / Morgan & Claypool, 2022. [doi]

Some Meditations on Advanced ProgrammingEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 301-310, ACM / Morgan & Claypool, 2022. [doi]

Solution of a Problem in Concurrent Programming ControlEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 311-314, ACM / Morgan & Claypool, 2022. [doi]

A Note on Two Problems in Connexion with GraphsEdsger W. Dijkstra. In Krzysztof R. Apt, Tony Hoare, editors, Edsger Wybe Dijkstra: His Life, Work, and Legacy. pages 287-290, ACM / Morgan & Claypool, 2022. [doi]

2005

My recollections of operating system designEdsger W. Dijkstra. sigops, 39(2):4-40, 2005. [doi]

2002

EWD1300: The Notational Conventions I Adopted, and WhyEdsger W. Dijkstra. fac, 14(2):99-107, 2002. [doi]

Solution of a Problem in Concurrent Programming Control (Reprint)Edsger W. Dijkstra. In Manfred Broy, Ernst Denert, editors, Software Pioneers. pages 347-350, Springer Berlin Heidelberg, 2002. [doi]

EWD 1308: What Led to "Notes on Structured Programming"Edsger W. Dijkstra. In Manfred Broy, Ernst Denert, editors, Software Pioneers. pages 340-346, Springer Berlin Heidelberg, 2002. [doi]

Go to Statement Considered Harmful (Reprint)Edsger W. Dijkstra. In Manfred Broy, Ernst Denert, editors, Software Pioneers. pages 351-355, Springer Berlin Heidelberg, 2002. [doi]

2001

The end of computing science?Edsger W. Dijkstra. CACM, 44(3):92, 2001. [doi]

Under the spell of Leibniz s dreamEdsger W. Dijkstra. ipl, 77(2-4):53-61, 2001. [doi]

Designing a Calculational Proof of Cantor's TheoremEdsger W. Dijkstra, Jayadev Misra. tamm, 108(5):440-443, 2001. [doi]

2000

On the transitive closure of a wellfounded relationEdsger W. Dijkstra. BIRTHDAY 2000: 31-40

1996

1995

Heuristics for a Calculational ProofEdsger W. Dijkstra. ipl, 53(3):141-143, 1995. [doi]

1992

On the Economy of doing MathematicsEdsger W. Dijkstra. mpc 1993: 2-10

The Unification of Three CalculiEdsger W. Dijkstra. nato 1993: 197-231 [doi]

1990

Making a Fair Roulette From a Possibly Biased CoinEdsger W. Dijkstra. ipl, 36(4):193, 1990.

Predicate calculus and program semanticsEdsger W. Dijkstra, Carel S. Scholten. Texts and monographs in computer science, Springer, 1990.

1989

A better way to combine efficient string length encoding and zero-terminationCoenraad Bron, Edsger W. Dijkstra. SIGPLAN, 24(6):11-19, 1989. [doi]

The Linear Search RevisitedEdsger W. Dijkstra, W. H. J. Feijen. stp, 10(1):5-9, 1989.

1988

On Binary Operators and Their Derived RelationsEdsger W. Dijkstra. bit, 28(3):378-382, 1988.

A method of programmingEdsger W. Dijkstra, W. H. J. Feijen. Addison-Wesley, 1988.

Position paper on "fairness"Edsger W. Dijkstra. sigsoft, 13(2):18-20, 1988. [doi]

1987

A Heuristic Explanation of Batcher s BafflerEdsger W. Dijkstra. SCP, 9(3):213-220, 1987.

1986

A Belated Proof of Self-StabilizationEdsger W. Dijkstra. dc, 1(1):5-6, 1986.

A Simple Fixpoint Argument Without the Restriction to ContinuityEdsger W. Dijkstra, A. J. M. van Gasteren. ACTA, 23(1):1-7, 1986.

1985

Methodik des ProgrammierensEdsger W. Dijkstra, Wim H. J. Feijen. Internationale Computer-Bibliothek, Addison-Wesley, 1985.

1983

Derivation of a Termination Detection Algorithm for Distributed ComputationsEdsger W. Dijkstra, W. H. J. Feijen, A. J. M. van Gasteren. ipl, 16(5):217-219, 1983.

Solutions of a Problem in Concurrent Programming Control (Reprint)Edsger W. Dijkstra. CACM, 26(1):21-22, 1983.

The fruits of misunderstandingEdsger W. Dijkstra. it, 25(6):10-13, 1983.

The Structure of THE -Multiprogramming System (Reprint)Edsger W. Dijkstra. CACM, 26(1):49-52, 1983.

1982

Smoothsort, an Alternative for Sorting In SituEdsger W. Dijkstra. SCP, 1(3):223-233, 1982.

An Introduction to Three Algorithms for Sorting in SituEdsger W. Dijkstra, A. J. M. van Gasteren. ipl, 15(3):129-134, 1982.

How do we tell truths that might hurt?Edsger W. Dijkstra. SIGPLAN, 17(5):13-15, 1982.

Selected writings on computing - a personal perspectiveEdsger W. Dijkstra. Texts and monographs in computer science, Springer, 1982.

1981

A Word of WelcomeEdsger W. Dijkstra. SCP, 1(1-2):3-4, 1981.

American programming's plightEdsger W. Dijkstra. sigsoft, 6(1):5, 1981. [doi]

1980

Some Beautiful Arguments Using Mathematical InductionEdsger W. Dijkstra. ACTA, 13:1-8, 1980.

Termination Detection for Diffusing ComputationsEdsger W. Dijkstra, Carel S. Scholten. ipl, 11(1):1-4, 1980.

1979

Software Engineering : As It Should BeEdsger W. Dijkstra. ICSE 1979: 442-448

1978

On-the-Fly Garbage Collection: An Exercise in CooperationEdsger W. Dijkstra, Leslie Lamport, Alain J. Martin, Carel S. Scholten, Elisabeth F. M. Steffens. CACM, 21(11):966-975, 1978.

Finding the Correctness Proof of a Concurrent ProgramEdsger W. Dijkstra. mfcs 1978: 31-38

On the Interplay between Mathematics and ProgrammingEdsger W. Dijkstra. pc 1979: 35-46

Finding the Correctness Proof of a Concurrent ProgramEdsger W. Dijkstra. pc 1979: 24-34

Program InversionEdsger W. Dijkstra. pc 1979: 54-57

On the Foolishness of Natural Language Programming Edsger W. Dijkstra. pc 1979: 51-53

A More Formal Treatment of a Less Simple ExampleEdsger W. Dijkstra. pc 1979: 2-20

A Theorem about Odd Powers of Odd IntegersEdsger W. Dijkstra. pc 1979: 47-48

In Honour of FibonacciEdsger W. Dijkstra. pc 1979: 49-50

Stationary Behaviour of Some Ternary NetworksEdsger W. Dijkstra. pc 1979: 21-23

DoD-I: the summing upEdsger W. Dijkstra. SIGPLAN, 13(7):21-26, 1978. [doi]

On a political pamphlet from the middle agesEdsger W. Dijkstra, Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis. sigsoft, 3(2):14-16, 1978. [doi]

1977

Programming: From Craft to Scientific DisciplineEdsger W. Dijkstra. icsym 1977: 23-30

A position paper on software reliabilityEdsger W. Dijkstra. sigsoft, 2(5):3-5, 1977. [doi]

1976

On a Gauntlet Thrown by David GriesEdsger W. Dijkstra. ACTA, 6:357-359, 1976.

The Effective Arrangement of Logical SystemsEdsger W. Dijkstra. mfcs 1976: 39-51

Formal Techniques and Sizeable ProgramsEdsger W. Dijkstra. eci 1976: 225-235

A Discipline of ProgrammingEdsger W. Dijkstra. Prentice-Hall, 1976.

1975

On-the-fly garbage collection: an exercise in cooperationEdsger W. Dijkstra, Leslie Lamport, Alain J. Martin, Carel S. Scholten, Elisabeth F. M. Steffens. ac 1976: 43-56

Guarded commands, non-determinancy and a calculus for the derivation of programsEdsger W. Dijkstra. ac 1976: 111-124

On the teaching of programming, i. e. on the teaching of thinkingEdsger W. Dijkstra. ac 1976: 1-10

A time-wise hierarchy imposed upon the use of a two-level storeEdsger W. Dijkstra. ac 1976: 345-357

Craftsman or ScientistEdsger W. Dijkstra. pacific 1975: 217-223

Guarded Commands, Nondeterminacy and Formal Derivation of ProgramsEdsger W. Dijkstra. CACM, 18(8):453-457, 1975.

Correctness concerns and, among other things, why they are resentedEdsger W. Dijkstra. relsoft 1975: 546 [doi]

Guarded commands, non-determinacy and a calculus for the derivation of programsEdsger W. Dijkstra. relsoft 1975: 2 [doi]

1974

Self-stabilizing Systems in Spite of Distributed ControlEdsger W. Dijkstra. CACM, 17(11):643-644, 1974.

1972

Structured programmingOle-Johan Dahl, Edsger W. Dijkstra, Charles Antony Richard Hoare. Volume 8 of A.P.I.C. Studies in data processing, Academic Press, 1972.

Information Streams Sharing a Finite BufferEdsger W. Dijkstra. ipl, 1(5):179-180, 1972.

The Humble ProgrammerEdsger W. Dijkstra. CACM, 15(10):859-866, 1972.

A class of allocation strategies inducing bounded delays onlyEdsger W. Dijkstra. afips 1972: 933-936 [doi]

1971

Hierarchical Ordering of Sequential ProcessesEdsger W. Dijkstra. ACTA, 1:115-138, 1971.

1968

The Structure of THE -Multiprogramming SystemEdsger W. Dijkstra. CACM, 11(5):341-346, 1968. [doi]

Letters to the editor: go to statement considered harmfulEdsger W. Dijkstra. CACM, 11(3):147-148, 1968. [doi]

Letters to the editor: The go to statement reconsideredJohn R. Rice, Edsger W. Dijkstra. CACM, 11(8):538, 1968. [doi]

1967

The structure of the "THE"-multiprogramming systemEdsger W. Dijkstra. sosp 1967: [doi]

1965

Solution of a problem in concurrent programming controlEdsger W. Dijkstra. CACM, 8(9):569, 1965. [doi]

1964

Some comments on the aims of MIRFACEdsger W. Dijkstra. CACM, 7(3):190, 1964. [doi]

1962

Some Meditations on Advanced ProgrammingEdsger W. Dijkstra. ifip 1962: 535-538

Operating Experience with ALGOL 60Edsger W. Dijkstra. cj, 5(2):125-127, 1962. [doi]

1961

Letter to the editor: defense of ALGOL 60Edsger W. Dijkstra. CACM, 4(11):502-503, 1961. [doi]

1959

ALGOL Sub-Committee Report - ExtensionsEdsger W. Dijkstra, W. Heise, Alan J. Perlis, Klaus Samelson. CACM, 2(9):24, 1959.

Communication with an Automatic ComputerEdsger W. Dijkstra. PhD thesis, University of Amsterdam, 1959. [doi]

A note on two problems in connexion with graphsEdsger W. Dijkstra. nm, 1:269-271, 1959. [doi]

Sign in or sign up to see more results.

runs on WebDSL