Paper Info
Title
Fast static analysis of C++ virtual function calls
Abstract
Virtual functions make code easier for programmers to reuse but also make it harder for compilers to analyze. We investigate the ability of three static analysis algorithms to improve C++ programs by resolving virtual function calls, thereby reducing compiled code size and reducing program complexity so as to improve both human and automated program understanding and analysis. In measurements of seven programs of significant size (5000 to 20000 lines of code each) we found that on average the most precise of the three algorithms 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 PowerPC 601. Because of its accuracy and speed, this algorithm is an excellent candidate for inclusion in production C++ compilers.
Year
DOI
Venue
1996
10.1145/236337.236371
OOPSLA
Keywords
Field
DocType
static analysis,lines of code
Unreachable code,Programming language,Computer science,Parallel computing,Static analysis,Compiler,Redundant code,Theoretical computer science,Compiled language,Virtual function,Source lines of code,Dead code
Conference
Volume
Issue
ISSN
31
10
0362-1340
ISBN
Citations 
PageRank 
0-89791-788-X
249
14.76
References 
Authors
16
2
Search Limit
100249
Name
Order
Citations
PageRank
David F. Bacon12179235.33
Peter F. Sweeney274269.82