Efficiently Computing SSA Form and the Control Dependence Graph (1991)

You and Your Research

Proving the Coding Interview

Neurosymbolic Programming (2021)

(Development of) AppleScript

The Threats to Computing Science

Neuro Evolving Robot Operatives

A commemoration of Edsger Dijkstra

A Flying Demo of ACL2 (2000)

The Boyer-Moore Fast String Searching Algorithm

Why numbering should start at zero (1982)

On Understanding Data Abstraction, Revisited (2009)

The TRIPS project: an explicit data graph execution (EDGE) processor

How do we tell truths that might hurt? – E.W.Dijkstra

E.W.Dijkstra Archive: On the foolishness of “natural language programming”

A Simple Scheme Compiler

My new iPhone runs Z3 faster than my (rather expensive) Intel desktop

The undeserved status of the pigeon-hole principle (1991)

To the members of the Budget Council (2001)

Memory Consistency Models (2016)

Synthesizing JIT Compilers for In-Kernel DSLs

On Iteration and Recursion

Truisms (1978)

Numbering should start at zero, by Dijkstra

Dijkstra: Philips and I – a few snapshots

On the cruelty of really teaching computing science (1988)

The Most Dangerous Code in the World

Dijkstra Archive (1930-2002)

Computer Science vs. Computing Science

How do we tell truths that might hurt? (Dijkstra, 1982)

More →