Around 1965, E. W. Dijkstra first used the stew and pudding problem to illustrate deadlocks. (See Deadlocks).