3 ms·
> Some code can be safe but is hard to reason about. This is a point I made back when I was doing verification. Yes, you can write code for which termination c
by Animats 3y ago
> Some code can be safe but is hard to reason about.
This is a point I made back when I was doing verification. Yes, you can write code
for which termination cannot be proven. If termination for your code is theoretically undecidable, it probably won't work right anyway. So don't go there.
Microsoft took a hard line on this with their Static Driver Verifier, a proof of memory correctness system for Windows kernel drivers. If your driver code is so hard to analyze that automatic path analysis can't verify memory correctness, it doesn't get signed to run in kernel space. Driver-caused Windows kernel crashes, formerly a huge problem, mostly went away.