Is there any way to be sure that a given program will do exactly a specific task?
Let's say I want to make a round-robin scheduler. Is there some way that I can be sure that certain program I've written will do exactly that?
Do you need to prove it absolutely?
| Yes. -> You'll need something like Coq.
| Not really. -> Use an ML.
BitC was going to include a prover, but they eventually decided that it all comes down to a matter of confidence and the prover didn't add enough, and nobody would use it. Personally I'd like to make selective use of a prover but doing a whole nontrivial program sounds insane to me.
Name:
Anonymous2011-11-28 18:28
There's no way to know for sure. No way.No way.
Everything is based on baseless logic. Even reality itself is based on baseless logic.