A quick word about partial vs total correctness in our axiomatic specifications. Remember that we are talking about partial correctness in class. For the command c:

{A}c{B}

When dealing with everything but loops, the distinction between this and total correctness has little impact on our work. However, it is important to remember that the notation:

{A}while b do c{B}

says that B is true if c terminates. Thus, partial correctness. Total correctness is harder to deal with and our book chooses not to do so.

Remember to look at the last rule from class for Monday:

|=(A=>A') {A'}c{B'} |=(B=>B')------------------------------------- {A}c{B}