|
Abstract : |
This paper shows that a type graph (obtained via polymorphic type inference) harbors explicit directional ow paths between functions. These ow paths arise from the instantiations of polymorphic types and correspond to call-return sequences in rst-order programs. We show that ow information can be computed eciently while considering only paths with well matched call-return sequences, even in the higher-order case. Furthermore, we present a practical algorithm for inferring type instantiation graphs and provide empirical evidence to the scalability of the presented techniques by applying them in the context of points-to analysis for C programs., |
