Ludwig Schläfli

Predicate transformer semantics were introduced by Dijkstra in his seminal paper "Guarded commands, nondeterminacy and formal derivation of programs". They define the semantics of an imperative programming paradigm by assigning to each statement in this language a corresponding predicate transformer: a total function between two predicates on the state space of the statement. In this sense, predicate transformer semantics are a kind of denotational semantics. Actually, in Guarded commands, Dijkstra uses only one kind of predicate transformers: the well-known weakest preconditions (see below).

Moreover, predicate transformer semantics are a reformulation of Floyd–Hoare logic. Whereas Hoare logic is presented as a deductive system, predicate transformer semantics (either by weakest-preconditions or by strongest-postconditions see below) are complete strategies to build valid deductions of Hoare logic. In other words, they provide an effective algorithm to reduce the problem of verifying a Hoare triple to the problem of proving a first-order formula. Technically, predicate transformer semantics perform a kind of symbolic execution of statements into predicates: execution runs backward in the case of weakest-preconditions, or runs forward in the case of strongest-postconditions.

Weakest preconditions

Definition

Given S a statement, the weakest-precondition of S is a function mapping any postcondition R to a precondition. Actually, the result of this function, denoted $wp(S,R)$, is the "weakest" precondition on the initial state ensuring that execution of S terminates in a final state satisfying R.

More formally, let us use variable x to denote abusively the tuple of variables involved in statement S. Then, a given Hoare triple $\{P\}S\{Q\}$ is provable in Hoare logic for total correctness if and only if the first-order predicate below holds:

$\mathrm{\forall }x,P\Rightarrow wp(S,Q)$

Formally, weakest-preconditions are defined recursively over the abstract syntax of statements. Actually, weakest-precondition semantics is a Continuation-passing style semantics of state transformers where the predicate in parameter is a continuation.

Skip

$wp(\mathbf{\text{<mrow data-mjx-texclass="ORD">skip</mrow>}},R)=R$

Abort

$wp(\mathbf{\text{<mrow data-mjx-texclass="ORD">abort</mrow>}},R)=\mathbf{\text{<mrow data-mjx-texclass="ORD">false</mrow>}}$

Assignment

We give below two equivalent weakest-preconditions for the assignment statement. In these formulas, $R[x\leftarrow E]$ is a copy of R where free occurrences of x are replaced by E. Hence, here, expression E is implicitly coerced into a valid term of the core logic: it is thus a pure expression, totally defined, terminating and without side effect.

• version 1:

$wp(x:=E,R)=\mathrm{\forall }y,y=E\Rightarrow R[x\leftarrow y]$ where y is a fresh variable (representing the final value of variable x)

• version 2:

$wp(x:=E,R)=R[x\leftarrow E]$

The first version avoids a potential duplication of E in R, whereas the second version is simpler when there is at most a single occurrence of x in R. The first version also reveals a deep duality between weakest-precondition and strongest-postcondition (see below).

An example of a valid calculation of wp (using version 2) for assignments with integer valued variable x is:

$\begin{array}{rcl}wp(x:=x-5,x>10)& =& x-5>10\\ & \iff & x>15\end{array}$

This means that in order for the postcondition x > 10 to be true after the assignment, the precondition x > 15 must be true before the assignment. This is also the "weakest precondition", in that it is the "weakest" restriction on the value of x which makes x > 10 true after the assignment.

Sequence

$wp(S_1;S_2,R)=wp(S_1,wp(S_2,R))$

For example,

$\begin{array}{rcl}wp(x:=x-5;x:=x*2,x>20)& =& wp(x:=x-5,wp(x:=x*2,x>20))\\ & =& wp(x:=x-5,x*2>20)\\ & =& (x-5)*2>20\\ & =& x>15\end{array}$

Conditional

$wp(\mathbf{\text{<mrow data-mjx-texclass="ORD">if</mrow>}}E\mathbf{\text{<mrow data-mjx-texclass="ORD">then</mrow>}}{S}_1\mathbf{\text{<mrow data-mjx-texclass="ORD">else</mrow>}}{S}_2\mathbf{\text{<mrow data-mjx-texclass="ORD">end</mrow>}},R)=(E\Rightarrow wp(S_1,R))\wedge (\mathrm{\neg }E\Rightarrow wp(S_2,R))$

As example:

$\begin{array}{rcl}wp(\mathbf{\text{<mrow data-mjx-texclass="ORD">if</mrow>}}x<y\mathbf{\text{<mrow data-mjx-texclass="ORD">then</mrow>}}x:=y\mathbf{\text{<mrow data-mjx-texclass="ORD">else</mrow>}}\mathbf{\text{<mrow data-mjx-texclass="ORD">skip</mrow>}}\mathbf{\text{<mrow data-mjx-texclass="ORD">end</mrow>}},x\ge y)& =& (x<y\Rightarrow wp(x:=y,x\ge y))\wedge (\mathrm{\neg }(x<y)\Rightarrow wp(\mathbf{\text{<mrow data-mjx-texclass="ORD">skip</mrow>}},x\ge y))\\ & =& (x<y\Rightarrow y\ge y)\wedge (\mathrm{\neg }(x<y)\Rightarrow x\ge y)\\ & \iff & \mathbf{\text{<mrow data-mjx-texclass="ORD">true</mrow>}}\end{array}$

While loop

Weakest-precondition of while-loop is usually parametrized by a predicate I called loop invariant, and a well-founded relation on the space state denoted "<" and called loop variant. Hence, we have:

$wp(\mathbf{\text{<mrow data-mjx-texclass="ORD">while</mrow>}}E\mathbf{\text{<mrow data-mjx-texclass="ORD">do</mrow>}}S\mathbf{\text{<mrow data-mjx-texclass="ORD">done</mrow>}},R)=\begin{array}{l}I\\ \wedge \mathrm{\forall }y,((E\wedge I)\Rightarrow wp(S,I\wedge x<y))[x\leftarrow y]\\ \wedge \mathrm{\forall }y,((\mathrm{\neg }E\wedge I)\Rightarrow R)[x\leftarrow y]\end{array}$ where y is a fresh tuple of variables

Informally, in the above conjunction of three formulas:

• the first one means that invariant I must initially hold;
• the second one means that the body of the loop (e.g. statement S) must preserve the invariant and decrease the variant: here, variable y represents the initial state of the body execution;
• the last one means that R must be established at the end of the loop: here, variable y represents the final state of the loop.

In predicate transformers semantics, invariant and variant are built by mimicking the Kleene fixed-point theorem. Below, this construction is sketched in set theory. We assume that U is a set denoting the state space. First, we define a family of subsets of U denoted $(A_k{)}_{k\in \mathbb{\mathbb{N}}}$ by induction over Natural number k. Informally $A_k$ represents the set of initial states that makes R satisfied after less than k iterations of the loop:

$\begin{array}{rcl}{A}_0& =& \mathrm{\varnothing }\\ A_{k+1}& =& \{y\in U|((E\Rightarrow wp(S,x\in A_k))\wedge (\mathrm{\neg }E\Rightarrow R))[x\leftarrow y]\}\\ \end{array}$

Then, we define:

• invariant I as the predicate $\mathrm{\exists }k,x\in A_k$.
• variant $y<z$ as the proposition $\mathrm{\exists }i,y\in A_i\wedge (\mathrm{\forall }j,z\in A_j\Rightarrow i<j)$

With these definitions, $wp(\mathbf{\text{<mrow data-mjx-texclass="ORD">while</mrow>}}E\mathbf{\text{<mrow data-mjx-texclass="ORD">do</mrow>}}S\mathbf{\text{<mrow data-mjx-texclass="ORD">done</mrow>}},R)$ reduces to formula $\mathrm{\exists }k,x\in A_k$.

However in practice, such an abstract construction can not be handled efficiently by theorem provers. Hence, loop invariants and variants are provided by human users, or are inferred by some abstract interpretation procedure.

Non-deterministic guarded commands

Actually, Dijkstra's Guarded Command Language (GCL) is an extension of the simple imperative language given until here with non-deterministic statements. Indeed, GCL aims to be a formal notation to define algorithms. Non-deterministic statements represent choices left to the actual implementation (in an effective programming language): properties proved on non-deterministic statements are ensured for all possible choices of implementation. In other words, weakest-preconditions of non-deterministic statements ensure

• that there exists a terminating execution (e.g. there exists an implementation),
• and, that the final state of all terminating execution satisfies the postcondition.

Notice that the definitions of weakest-precondition given above (in particular for while-loop) preserve this property.

Selection

Selection is a generalization of if statement:

$wp(\mathbf{i}\mathbf{f}{E}_1\to S_1[]\dots []E_n\to S_n\mathbf{f}\mathbf{i},R)=\begin{array}{l}(E_1\vee \dots \vee E_n)\\ \wedge (E_1\Rightarrow wp(S_1,R))\\ \dots \\ \wedge (E_n\Rightarrow wp(S_n,R))\\ \end{array}$

Here, when two guards $E_i$ and $E_j$ are simultaneously true, then execution of this statement can run any of the associated statement $S_i$ or $S_j$.

Repetition

Repetition is a generalization of while statement in a similar way.

Specification statement (or weakest-precondition of procedure call)

Refinement calculus extends non-deterministic statements with the notion of specification statement. Informally, this statement represents a procedure call in black box, where the body of the procedure is not known. Typically, using a syntax close to B-Method, a specification statement is written

$P|$ @$y.Q\to x:=y$

where

• x is the global variable modified by the statement,
• P is a predicate representing the precondition,
• y is a fresh logical variable, bound in Q, that represents the new value of x non-deterministically chosen by the statement,
• Q is a predicate representing a postcondition, or more exactly a guard: in Q, variable x represents the initial state and y denotes the final state.

The weakest-precondition of specification statement is given by:

$wp(P|$ @$y.Q\to x:=y,R)=P\wedge \mathrm{\forall }z,Q[y\leftarrow z]\Rightarrow R[x\leftarrow z]$ where z is a fresh name

Moreover, a statement S implements such a specification statement if and only if the following predicate is a tautology:

$\mathrm{\forall }{x}_0,(P\Rightarrow wp(S,Q[x\leftarrow x_0][y\leftarrow x]))[x\leftarrow x_0]$ where $x_0$ is a fresh name (denoting the initial state)

Indeed, in such a case, the following property is ensured for all postcondition R (this is a direct consequence of wp monotonicity, see below):

$wp(P|$ @$y.Q\to x:=y,R)\Rightarrow wp(S,R)$

Informally, this last property ensures that any proof about some statement involving a specification remains valid when replacing this specification by any of its implementations.

Other predicate transformers

Weakest liberal precondition <Weakest liberal precondition>...</Weakest liberal precondition>

An important variant of the weakest precondition is the weakest liberal precondition $wlp(S,R)$, which yields the weakest condition under which S either does not terminate or establishes R. It therefore differs from wp in not guaranteeing termination. Hence it corresponds to Hoare logic in partial correctness: for the statement language given above, wlp differs with wp only on while-loop, in not requiring a variant.

Strongest postcondition

Given S a statement and R a precondition (a predicate on the initial state), then $sp(S,R)$ is their strongest-postcondition: it implies any postcondition satisfied by the final state of any execution of S, for any initial state statisfying R. In other words, a Hoare triple $\{P\}S\{Q\}$ is provable in Hoare logic if and only if the predicate below hold:

$\mathrm{\forall }x,sp(S,P)\Rightarrow Q$

Usually, strongest-postconditions are used in partial correctness. Hence, we have the following relation between weakest-liberal-preconditions and strongest-postconditions:

$(\mathrm{\forall }x,P\Rightarrow wlp(S,Q))\iff (\mathrm{\forall }x,sp(S,P)\Rightarrow Q)$

For example, on assignment we have:

$sp(x:=E,R)=\mathrm{\exists }y,x=E[x\leftarrow y]\wedge R[x\leftarrow y]$ where y is fresh

Above, the logical variable y represents the initial value of variable x. Hence,

$sp(x:=x-5,x>15)=\mathrm{\exists }y,x=y-5\wedge y>15\iff x>10$

On sequence, it appears that sp runs forward (whereas wp runs backward):

$sp(S_1;S_2,R)=sp(S_2,sp(S_1,R))$

Win and sin predicate transformers

Leslie Lamport has suggested win and sin as predicate transformers for concurrent programming.

Predicate transformers properties

This section presents some characteristic properties of predicate transformers. Below, T denotes a predicate transformer (a function between two predicates on the state space) and P a predicate. For instance, T(P) may denote wp(S,P) or sp(S,P). We keep x as the variable of the state space.

Monotonic

Predicate transformers of interest (wp, wlp, and sp) are monotonic. A predicate transformer T is monotonic if and only if:

$(\mathrm{\forall }x,P\Rightarrow Q)\Rightarrow (\mathrm{\forall }x,T(P)\Rightarrow T(Q))$

This property is related to Consequence rule of Hoare logic.

Strict

A predicate transformer T is strict iff:

$T(\mathbf{f}\mathbf{a}\mathbf{l}\mathbf{s}\mathbf{e})\iff \mathbf{f}\mathbf{a}\mathbf{l}\mathbf{s}\mathbf{e}$

For instance, wp is strict, whereas wlp is generally not. In particular, if statement S may not terminate then $wlp(S,\mathbf{f}\mathbf{a}\mathbf{l}\mathbf{s}\mathbf{e})$ is satisfiable. We have

$wlp(\mathbf{w}\mathbf{h}\mathbf{i}\mathbf{l}\mathbf{e}\mathbf{t}\mathbf{r}\mathbf{u}\mathbf{e}\mathbf{d}\mathbf{o}\mathbf{s}\mathbf{k}\mathbf{i}\mathbf{p}\mathbf{d}\mathbf{o}\mathbf{n}\mathbf{e},\mathbf{f}\mathbf{a}\mathbf{l}\mathbf{s}\mathbf{e})\iff \mathbf{t}\mathbf{r}\mathbf{u}\mathbf{e}$

Indeed, true is a valid invariant of that loop.

Terminating

A predicate transformer T is terminating iff:

$T(\mathbf{t}\mathbf{r}\mathbf{u}\mathbf{e})\iff \mathbf{t}\mathbf{r}\mathbf{u}\mathbf{e}$

Actually, this terminology makes sense only for strict predicate transformers: indeed, $wp(S,\mathbf{t}\mathbf{r}\mathbf{u}\mathbf{e})$ is the weakest-precondition ensuring termination of S.

It seems that naming this property non-aborting would be more appropriate: in total correctness, non-termination is abortion, whereas in partial correctness, it is not.

Conjunctive

A predicate transformer T is conjunctive iff:

$T(P\wedge Q)\iff (T(P)\wedge T(Q))$

This is the case for $wp(S,.)$, even if statement S is non-deterministic as a selection statement or a specification statement.

Disjunctive

A predicate transformer T is disjunctive iff:

$T(P\vee Q)\iff (T(P)\vee T(Q))$

This is generally not the case of $wp(S,.)$ when S is non-deterministic. Indeed, let us consider a non-deterministic statement S choosing an arbitrary boolean. This statement is given here as the following selection statement:

$S=\mathbf{i}\mathbf{f}\mathbf{t}\mathbf{r}\mathbf{u}\mathbf{e}\to x:=0[]\mathbf{t}\mathbf{r}\mathbf{u}\mathbf{e}\to x:=1\mathbf{f}\mathbf{i}$

Then, $wp(S,R)$ reduces to the formula $R[x\leftarrow 0]\wedge R[x\leftarrow 1]$.

Hence, $wp(S,x=0\vee x=1)$ reduces to the tautology $(0=0\vee 0=1)\wedge (1=0\vee 1=1)$

Whereas, the formula $wp(S,x=0)\vee wp(S,x=1)$ reduces to the wrong proposition $(0=0\wedge 1=0)\vee (1=0\wedge 1=1)$.

The same counter-example can be reproduced using a specification statement (see above) instead:

$S=\mathbf{t}\mathbf{r}\mathbf{u}\mathbf{e}|$ @$y.y\in \{0,1\}\to x:=y$

Applications

• Computations of weakest-preconditions are largely used to statically check assertions in programs using a theorem-prover (like SMT-solvers or proof assistants): see Frama-C or ESC/Java2.

• Unlike many other semantic formalisms, predicate transformer semantics was not designed as an investigation into foundations of computation. Rather, it was intended to provide programmers with a methodology to develop their programs as "correct by construction" in a "calculation style". This "top-down" style was advocated by Dijkstra and N. Wirth. It has been formalized further by R.-J. Back and others in the Refinement Calculus. Some tools like B-Method now provide automated reasoning in order to promote this methodology.

• In the meta-theory of Hoare logic, weakest-preconditions appear as a key notion in the proof of relative completeness.

Beyond predicate transformers

Weakest-preconditions and strongest-postconditions of imperative expressions

In predicate transformers semantics, expressions are restricted to terms of the logic (see above). However, this restriction seems too strong for most existing programming languages, where expressions may have side effects (call to a function having a side effect), may not terminate or abort (like division by zero). There are many proposals to extend weakest-preconditions or strongest-postconditions for imperative expression languages and in particular for monads.

Among them, Hoare Type Theory combines Hoare logic for a Haskell-like language, Separation logic and Type Theory . This system is currently implemented as a Coq library called Ynot. In this language, evaluation of expressions corresponds to computations of strongest-postconditions.

Probabilistic Predicate Transformers

Probabilistic Predicate Transformers are an extension of predicate transformers for probabilistic programs. Indeed, such programs have many applications in cryptography (hiding of information using some randomized noise), Distributed systems (symmetry breaking).

See also

• Axiomatic semantics — includes predicate transformer semantics
• Formal semantics of programming languages — an overview
• Hoare logic — the best-known axiomatic semantics
• Refinement calculus, an extension of guarded commands (and Hoare logic) exploiting the lattice structure of predicate transformers (for "refinement" order).
• Dynamic logic, where predicate transformers appear as modalities (in the sense of Modal logic).

Notes

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

References

• J. W. de Bakker. Mathematical theory of program correctness. Prentice-Hall, 1980.
• Marcello M. Bonsangue and Joost N. Kok, The weakest precondition calculus: Recursion and duality, Formal Aspects of Computing, 6(6):788–800, November 1994. DOI 10.1007/BF01213603.
• Edsger W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of program. Communications of the ACM, 18(8):453–457, August 1975. [1]
• Edsger W. Dijkstra. A Discipline of Programming. ISBN 0-613-92411-8. — A systematic introduction to a version of the guarded command language with many worked examples
• Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag 1990 ISBN 0-387-96957-8 — A more abstract, formal and definitive treatment
• David Gries. The Science of Programming. Springer-Verlag 1981 ISBN 0-387-96480-0