Predicate transformer semantics: Difference between revisions

Revision as of 13:13, 19 May 2023

Revision as of 00:50, 18 July 2023

Line 101:

{| style="background-color:#eeeeff;" border="1" cellpadding="10"

|<math>wp(\texttt{while}\ E\ \texttt{do}\ S\ \texttt{done}, R)\ \ = \ \ \text{the\ strongest\ solution\ of \ the\ recursive\ equation} \

\begin{array}[t]{l}