Scalable context-sensitive flow analysis using instantiation constraints

This paper shows that a type graph (obtained via polymorphic type inference ) harbors explicit directional how paths between functions. These flow path s arise from the instantiations of polymorphic types and correspond to call -return sequences in first-order programs. We show that flow information ca n be computed efficiently while considering only paths with well matched ca ll-return sequences, even in the higher-order case. Furthermore, rye presen t a practical algorithm for inferring type instantiation graphs and provide empirical evidence to the scalability of the presented techniques by apply ing them in the context of points-to analysis for C programs.