3 ms·
There is no mathematically rigorous way of proving that any given piece of code does or doesn't do anything. Sure there is. http://en.wikipedia.org/wiki/Forma
by yummyfajitas 18y ago
There is no mathematically rigorous way of proving that any given piece of code does or doesn't do anything.
Sure there is.
http://en.wikipedia.org/wiki/Formal_verification http://en.wikipedia.org/wiki/Formal_verification
- dhs 18y agoFormal verification works for algorithms, but not for interactions.
- godDLL 18y agoRun it on MS Word X, then. Or OOO v3. And draw any meaningful conclusions from that data. Better yet, how do I write reliable software that runs on a buggy processor? What do I use to test that the chip I'm making does what it is supposed to every time for all scenarios? It's programmable, after all. That, I'm sure, you can identify with.
- ori_b 18y agoThat proves that it conforms to the specified behavior. It doesn't prove that the specified behavior is correct or useful.