News for hackers. Stuff that matters.
Re:Nearly all binary search and merge sort implementations a... by wtallis on Monday January 30, 2012 @05:41PM (#3530937)
All proofs start from some assumptions. When you are proving programs, you assume that the hardware is functioning properly. After all, anyone going to the expense of proving their software is correct will also pay for ECC throughout their hardware. Once you've proven your software correct, you can make assurances about the behavior of the software when run on particular hardware, and those assurances will be limited primarily by the reliability of the hardware.
Re:Nearly all binary search and merge sort implementations a... by blackhole on Monday January 30, 2012 @09:52PM (#3531595)
Assuming that hardware will work correctly can be an extremely dangerous assumption.