Using dynamic analysis to discover polynomial and array invariants

ThanhVu Nguyen, Deepak Kapur, Westley Weimer, Stephanie Forrest
2012 2012 34th International Conference on Software Engineering (ICSE)  
Dynamic invariant analysis identifies likely properties over variables from observed program traces. These properties can aid programmers in refactoring, documenting, and debugging tasks by making dynamic patterns visible statically. Two useful forms of invariants involve relations among polynomials over program variables and relations among array variables. Current dynamic analysis methods support such invariants in only very limited forms. We combine mathematical techniques that have not
more » ... ously been applied to this problem, namely equation solving, polyhedra construction, and SMT solving, to bring new capabilities to dynamic invariant detection. Using these methods, we show how to find equalities and inequalities among nonlinear polynomials over program variables, and linear relations among array variables of multiple dimensions. Preliminary experiments on 24 mathematical algorithms and an implementation of AES encryption provide evidence that the approach is effective at finding these invariants.
doi:10.1109/icse.2012.6227149 dblp:conf/icse/NguyenKWF12 fatcat:q2yihdfyinc6bbej5izmuo5j7y