So I don't see how they can possibly be part of the language spec when they are completely optional.
What is a "side channel"? Proofs show correctness, to the point that there is nothing left to show. It is correct.
-
-
After reading the rest of the thread, are you talking about a Lambda Calc proof of an implementation? I'm interested to see an example or two. Side channels from the hardware your implementation runs on make the proof heuristic. On paper it's perfect. On silicon, less so.
-
They emit information through EMF. They constrain where none exists in the proof. Formally verified algorithms get owned all the time by unseen constraints. That's why all abstractions are leaky and all oracles are heuristic. Gödel's Incompleteness is related.
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.