I think that statically guaranteeing something like in-bound indexing or absence of division by zero you need depended types, which is not exactly easy nor mainstream. And even with dependent types, many non-evil, otherwise correct programs will be rejected.
Yes, for the general problem you want dependent types (or similar).
There are middle grounds, of course: you can let the compiler figure out on its own what it can, and let it insert runtime checks for the other cases.
And add some way for the programmer to declare that eg "warn me if this can't be optimized" or "trust me, this is safe" or even "here's a proof for you".
But in any case, dependent types are possible---undecidability is not a hard barrier here.
Aren't dependent types able to express any statement formalizable in predicate logic? This should include most things you might want to say about the correctness of non-evil programs. I think the real problem with them is that type-checking itself becomes undecidable, so you get the additional problem of proving that your program is indeed correctly typed.
Re:Undefined Behavior in 2017
by tom_mellior on Wednesday July 05, 2017 @06:12PM
(#14706520)
Here are two nice blog posts on the state of the art of this "not too hard" problem:
https://maniagnosis.crsr.net/2017/06/AFL-brute-force-search....
https://maniagnosis.crsr.net/2017/06/AFL-bug-in-quicksearch....
Possible? Yes. Too time-consuming and fiddly for the economic realities of 99.9% of all programmers? Yes, that too.
The economic realities would be quite different if software companies were legally accountable for their defects, just like in many other industries.
The halting problem is impossible to solve for arbitrarily evil programs, but that doesn't mean that it's impossible to write programs that are easy to analyse.