Bi-directional Demand-Driven Set-Based Analysis ⁄
Woongsik Choi, Kwangkeun Yi · 2002
In this paper, we present a bi-directional demand-driven set-based analysis which solves only those constraints affecting program points one wants to analyze. To achieve this goal, we incorporate the notion of demands on set constraints and analyze programs in two directions: forward to know which values flow into a given point, and backward to know which program points that a given value flows into. We prove that for interested program points, our analysis gives exactly the same results as whole-program set-based analysis. As an experiment of our approach, we analyzed each program point separately using our demand-driven formulation. We report the efficiency of our analysis as percentage of constraints solved for each program point compared with the whole-program analysis. 1