Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Barth J., A Practical Interprocedural Data Flow Analysis Algorithm, CACM 21(9):724–736, 1978.
2. Bacon, D. F., and P. F. Sweeney, Fast Static Analysis of Virtual Function Calls in C++, OOPSLA'96, pp. 324–341.
3. Cook S. A., Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, JACM 18(1):4–18, Jan. 1971.
4. Carini P. R. and M. Hind, Flow-sensitive interprocedural constant propagation, PLDI'95, pp. 23–31.
5. Chambers C., Grove D., DeFouw G., and J. Dean, Call Graph Construction in Object-Oriented Languages, OOPSLA'97, pp. 108–124.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. When do Software Complexity Metrics Mean Nothing? – When Examined out of Context.;The Journal of Object Technology;2016
2. Object Initialization in X10;ECOOP 2012 – Object-Oriented Programming;2012
3. Are We Ready for a Safer Construction Environment?;Lecture Notes in Computer Science;2009
4. Efficient dynamic dispatching with type slicing;ACM Transactions on Programming Languages and Systems;2007-11
5. Sealing, Encapsulation, and Mutablility;ECOOP 2001 — Object-Oriented Programming;2001