Algorithm 5.3 Call-Graph-Construction

Input: Signature of entry methods $m^{entry}$ .

Output: Call Graph CG, a set of call edges.

1:procedure BuildCallGraph( $m^{entry}$ )

2: $WL = [m^{entry}]$ // Work List, containing the methods to be processed

3: $CG = \{\}$ // Call Graph, a set of call edges

4: $RM = \{\}$ // A set of reachable methods

5:while $WL$ is not empty do

6:remove $m$ from $WL$ // $m$ is a method

7:if $m \notin RM$ then

8:add $m$ to $RM$

9:for each call site $cs$ in $m$ do

10: $T :=$ Resolve( $cs$ ) // Resolve target methods, probably via CHA

11:for each target method $m'$ in $T$ do

12:add $cs \to m'$ to $CG$

13:add $m'$ to $WL$

14:end for

15:end for

16:end if

17:end while

18:return $CG$

19:end procedure