In this assignment you are required to complete the total correctness proofs of all the programs of assignment 1. You need to prove the missing parts and put it all together. Each of the programs should be: partially-correct, successful, convergent, and fault-free (where applicable).
Your claims can depend on your proven claims from previous assignments. This means you can "reuse" your claims from previous exercises by quoting them as a "proven lemmas". However, do it only if:
Thursday 10/4/2003 at 11:00 (hand-in in class).