# Assignment 3

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:

- It really saves you time (don't refer to claims taking one-line proof).
- Each claim was correctly proved in previous exercise.
- I can easily understand your references.

## Hand-in and due date

Thursday 10/4/2003
at 11:00 (hand-in in class).