News for hackers. Stuff that matters.
Re:Nearly all binary search and merge sort implementations a... by jberryman on Monday January 30, 2012 @09:26PM (#3531531)
> But in practice, it's easy to make a simple mistake in implementation and accidentally throw your proof out the window.

But that's not how a proof of correctness works. You have an implementation (of an algorithm, say) and you prove mathematically that it is correct with respect to a formal specification. The implementation and proof aren't separate things.

There are no comments on this comment yet.