3 ms·
Sound static analysis can prove the absence of all undefined behavior. The theoretical problem isn't NP-hard but uncomputable in general, but that doesn't matte
by pron 10y ago
Sound static analysis can prove the absence of all undefined behavior. The theoretical problem isn't NP-hard but uncomputable in general, but that doesn't matter as most real instances are easy, and most of those that cannot be completely automatically proven can be proven with the addition of some annotations by the user. In the worst case, some sound static analyzers would fall to a manual proof in a proof assistant -- which is, undeniably overkill and very costly -- but even without it, the number of bugs is reduced almost to zero, and the places that the analyzer cannot prove are reported.