Predicate Calculus and Program Semantics

This text gives a self-contained foundation of predicate transformer semantics by making extensive use of the predicate calculus. The semantics of the repetitive construct is defined in terms of weakest and strongest solutions in terms of the weakest precondition and the weakest liberal precondition, the notion of determinacy is defined it is shown how to cope unbounded nondeterminacy without using transfinite induction.