A generalization of Owicki-Gries's Hoare logic for a concurrent while language

AbstractA syntax-directed generalization of Owicki–Gries's Hoare logic for a parallel while language is presented. The rules are based on Hoare asserted programs of the form {Γ,A} p {B, Δ} where Γ, Δ are sets of first-order formulas. These triples are interpreted with respect to an operational semantics involving potential computations where Γ, Δ are sets of invariants