Effective whole-program analysis in the presence of pointers

摘要: Understanding large software systems is difficult. Traditionally, automated tools are used to assist program understanding. However, the representations constructed by these often require prohibitive time and space. Demand-driven techniques can be reduce requirements. use of pointers in modern languages introduces additional problems that do not integrate well with techniques. We present new for effectively coping written C programming language our implement a slicing tool.First, we fast, flow-insensitive, points-to analysis before traditional data-flow analysis. Second, allow user parameterize so resulting slices more closely match actual behavior. Such information cannot easily obtained tool or might otherwise deemed unsafe. Finally, equations dealing local variables recursive programs. These select an arbitrary amount calling context order better trade performance precision.To validate techniques, empirical results using slicer on The indicate cost-effective programs feasible