> It is not sufficient merely to prove a program correct; you have to test it too. Well... If your proof made the (false) assumption that int is an unbounded i

> It is not sufficient merely to prove a program correct; you have to test it too. Well... If your proof made the (false) assumption that int is an unbounded integral type, then you didn't prove the program is correct at all. What you proved was than an algorithm in some ideal universe is correct. But your program is a different beast that lives in a specific programming language.