A general proof rule for procedures in predicate transformer semantics
From MaRDI portal
Publication:797986
DOI10.1007/BF00264276zbMath0546.68012OpenAlexW2015744089MaRDI QIDQ797986
Publication date: 1983
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00264276
Related Items (max. 100)
Proof rules for recursive procedures ⋮ A sharp proof rule for procedures in WP semantics ⋮ Predicate transformers and higher-order programs ⋮ Calculating with procedure calls ⋮ Equivalence of the Gries and Martin proof rules for procedure calls
This page was built for publication: A general proof rule for procedures in predicate transformer semantics
