The definitions for Dijkstra's predicate transformer semantics can be justified by considering the meaning of a program as a binary relation on states (which holds between two states if there is a terminating computation ...