Fast static analysis of C++ virtual function calls

Virtual functions make code easier for programmers to reuse but also make it harder for compilers to analyze. We investi-gate the ability of three static analysis algorithms to improve C++ programs by resolving virtual function calls, thereby reducing compiled code size and reducing program complex-ity so as to improve both human and automated program understanding and analysis. In measurements of seven pro-grams of significant size (5000 to 20000 lines of code each) we found that on average the most precise of the three algo-rithms resolved 71 % of the virtual function calls and reduced compiled code size by 25%. This algorithm is very fast: it analyzes 3300 source lines per second on an 80 MHz Pow-erPC 601. Because of its accuracy and speed, this algorithm is an excellent candidate for inclusion in production C++ compilers.