Constructing accurate application call graphs for java to model library callbacks

Proceedings - Sixth IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2006

Volumn , Issue , 2006, Pages 63-72

  Zhang, Weilei ^a   Ryder, Barbara ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL LIBRARIES; JAVA PROGRAMMING LANGUAGE; SOFTWARE ENGINEERING; SOFTWARE TESTING;

CALL GRAPHS; DATA REACHABILITY; LIBRARY METHODS;

GRAPH THEORY;

EID: 34948820727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCAM.2006.9     Document Type: Conference Paper

References (19)

1. R. Bodik, R. Gupta, and M. L. Soffa. Refining data flow information using infeasible paths. In M. Jazayeri and H. Schauer, editors, Proceedings of the Sixth European Software Engineering Conference (ESEC/FSE 97), pages 361-377. Springer-Verlag, 1997.
2. J.-D. Choi, M. Gupta, M. J. Serrano, V. C. Sreedhar, and S. P. Midkiff. Stack allocation and synchronization optimizations forjava using escape analysis. ACM Trans. Program. Lang. Syst., 25(6):876-910, 2003.
3. C. Fu, A. Milanova, B. G. Ryder, and D. Wonnacott. Robustness Testing of Java Server Applications. IEEE Transactions on Software Engineering, 31(4):292-311, Apr. 2005.
4. D. Grove and C. Chambers. A framework for call graph construction algorithms. ACM Transactions on Programming Languages and Systems (TOPLAS), 23(6), 2001.
5. M. Hind. Pointer analysis: haven't we solved this problem yet? In PASTE, pages 54-61, 2001.
6. http://bddbddb.sourceforge.net/. bddbddb:bdd-based deductive database.
7. http://www.sable.mcgill.ca/soot/. Soot: a java optimization framework.
8. O. Lhotak and L. Hendren. Scaling java points-to analysis using spark. International Conference on Compiler Construction, 2003.
9. S. Rapps and E. Weyuker. Selecting software test data using data flow information. IEEE Transactions on Software Engineering, SE-11(4):367-375, Apr. 1985.
10. A. Rountev, S. Kagan, and M. Gibas. Static and dynamic analysis of call chains in Java. In ACM SIGSOFT International Symposium on Software Testing and Analysis, pages 1-11, 2004.
11. A. Rountev, A. Milanova, and B. G. Ryder. Points-to analysis for java using annotated constraints. In Proceedings of the Conference on Object-oriented Programming, Languages, Systems and Applications, pages 43-55, 2001.
12. B.G.Ryder. Dimensions of precision in reference analysis of object-oriented programming languages. In Proceedings of the Twelveth International Conference on Compiler Construction, pages 126-137, April 2003. invited paper.
13. M. L. Scott. Programming Language Pragmatics. Morgan Kaufmann, 2000.
14. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, pages 189-234. Prentice Hall, 1981.
15. O. Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie Mellon University, 1991.
16. A. L. Souter and L. L. Pollock. Characterization and automatic identification of type infeasible call chains. Information and Software Technology, 44(13):721-732, October 2002.
17. Specbench.org. Java client/server benchmarks.
18. F. Tip and J. Palsberg. Scalable propagation-based call graph construction algorithms. In Proceedings of the Conference on Object-oriented Programming, Languages, Systems and Applications, pages 281-293, Oct. 2000.
19. W. Zhang and B. Ryder. A Semantics-Based Definition for Interclass Test Dependence. Technical Report DCS-TR-597, Department of Computer Science, Rutgers University, January 2006.