Technical Report: Improving and Evaluating the Scalability of Precise System Dependence Graphs for Objectoriented Languages

Static program analysis helps to answer questions about pro- gram properties such as if a given program does leak confidential information. Besides the well-known approaches using type-systems another way using dependence graphs seems to be promising. Once they are created they improve analysis precision significantly, but their creation suffers from poor performance. We evaluated the precision and scalability of dependence graph creation for object oriented languages and developed a new way to model interprocedural dependencies. This model improves time and memory consumption in some cases up to 90\% while it maintains the precision of the previous model.