Edsger W. Dijkstra
Dijkstra treated programming as an intellectual discipline in which clarity and proof matter. That insistence remains directly relevant to building software whose security properties can be understood and maintained.
Edsger W. Dijkstra made foundational contributions to algorithms and programming methodology, including the shortest-path algorithm that bears his name. He also argued forcefully for structured programming and formal reasoning about programs.
Reliable systems
His essays and lectures connected program construction to correctness. Security engineering inherits this concern: a system cannot reliably enforce a property that its builders cannot state or reason about.
In memoriam
Dijkstra died in 2002. His papers and lectures continue to influence computer-science education.
Timeline
- 1930-05-11Born in Rotterdam, Netherlands.
- 1956Develops the shortest-path algorithm later named for him.
- 1968Publishes “Go To Statement Considered Harmful.”
- 1972Receives the ACM A.M. Turing Award.
- 2002-08-06Dies in Nuenen, Netherlands.
Edsger W. Dijkstra
- Type
- Person
- Era
- 1950s-2002
- Born
- 1930
- Died
- 2002
- Known for
- programming; formal-methods; algorithms; computer-science
- Tags
- programming, formal-methods, algorithms, computer-science
Created by Joas A Santos · Something wrong or want it removed? Open an issue.