Konferenzen und Rahmenprogramm
Undecidable Rules and How to Live with Them
MISRA rules are classified as decidable or undecidable, depending on the theoretical ability of a static analyzer to answer the question "Does this code comply with this rule" with "yes" or "no" in every case. Undecidable rules require information about the program semantics, e.g., what value an object holds, or whether a particular program point is reachable. The well-known Rice Theorem proves that in such cases no static analyzer can give a correct yes/no answer in every case. However, depending on the depth of an analyzer it is possible to answer the questions with different levels of assurance: unsound analyzers can report false negatives (missed violations) and false positives (false alarms). With a sound analyzer the absence of false negatives can be proven, i.e., no violations are missed. The talk explains the concept of soundness, discusses to which degree the undecidable MISRA C rules can be covered by automatic tools, and what level of assurance can be reached.
--- Datum: 25.02.2020 Uhrzeit: 14:30 - 15:00 Uhr Ort: Conference Counter NCC Ost