Undecidability is a fundamental limitation that prevents any static analysis tools, no matter how sophisticated, from guaranteeing 100% enforcement of certain types of coding standard rules, or from fully and precisely identifying all instances of particular software defects. This webinar discusses:
"Thanks a lot for a great talk! I would just like to add that the theoretical undecidability results are, so to speak, "existential quantified", i.e., there is an instance of the problem that is undecidable - this does not automatically hold for all instances of the problem :-). Luckily, many problem instances for real programs are, indeed, decidable (e.g., we can decide termination for many interesting programs)."