Indeed, I should have said, "In reasoning about formal logic, and algorithm design in particular, there's almost always a formal proof of correctness available." And even then, one must keep in mind Knuth's famous, "Be careful in using this algorithm. I have only proven it correct, not tested it."
But statistical proof is, IMHO, no proof at all. It is at best evidence.
Take care,
Mickey.
Comment on Re^6: Comparative satisfiability of regexps.