Collection

Tag: program-correctness

Dijkstra and Weakest Preconditions: Deriving Programs from Desired Results

Dijkstra's weakest-precondition calculus turned program semantics into a backward calculation from desired postconditions toward the conditions needed for correct execution.

↗

Structured Programming and Dijkstra’s Campaign Against Uncontrolled Jumps

Structured programming reframed program clarity as an engineering property, arguing that control flow should be composed from understandable structures rather than arbitrary jumps.

↗