Termination
A Hoare triple for which termination has been proven is strongly correct
A Hoare triple that is true if termination occurs is weakly correct
Proofs of termination are usually performend separately from proofs of correctness, and they are usually performed through well-founded sets
- In this example it’s easy, since i is bounded by n, and i increases at each iteration
Historically, the interest has been in proving that a program does terminate
- Many important programs now are intended not to terminate