Static analysis based efficient elimination of false positive
AssigneeTata Consultancy Services Limited
InventorTukaram B Muske
Life of this patent
Estimating the term…
Loading patent…
AssigneeTata Consultancy Services Limited
InventorTukaram B Muske
Estimating the term…
A method and a system is disclosed herein for model checker based efficient elimination of false positives from static analysis warnings generated during static analysis of an application code. The system computes complete-range non-deterministic value variables (cnv variables) that are based on data flow analysis or static approximation of execution paths by control flow paths. During computation of cnv variables, over approximation (may-cnv variables) and under approximation (must-cnv variables) of a set of cnv variables at a program point is identified. The computed cnv variables are used to check whether an assertion variable is a cnv variable and the corresponding assertion verification call is redundant or otherwise. The identified redundant calls are then skipped for the efficiency of the false positives elimination and the model checker is invoked corresponding to the non-redundant assertion verification calls.
A method for efficient elimination of false positives generated in static analysis of an application code, the method comprising:
A system for efficient elimination of false positives in static analysis of application code, the system comprises:
A computer readable medium storing instructions for efficient elimination of false positives in static analysis of application code, the method comprising:
Dependencies are inferred from the claim text.