Scalable runtime bloat detection using abstract dynamic slicing

ACM Transactions on Software Engineering and Methodology

Volumn 23, Issue 3, 2014, Pages

  Xu, Guoqing ^a   Mitchell, Nick ^b   Arnold, Matthew ^b   Schonberg, Edith ^b   Sevitsky, Gary ^b   Rountev, Atanas ^c  

^a Irvine   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c Ohio State University   (United States)

Author keywords

Abstract dynamic slicing; Copy profiling; Cost benefit analysis; Dynamic analysis; Runtime bloat

Indexed keywords

ABSTRACTING; COMPUTER SOFTWARE; COST BENEFIT ANALYSIS; DYNAMIC ANALYSIS; SEMANTICS;

BETTER PERFORMANCE; DEPLOYED APPLICATIONS; DYNAMIC SLICING; IMPROVE PERFORMANCE; PERFORMANCE BOTTLENECKS; PERFORMANCE METRICS; PERFORMANCE OPTIMIZATIONS; RUNTIMES;

JAVA PROGRAMMING LANGUAGE;

EID: 84901596638     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/2560047     Document Type: Article

References (80)

1. H. Agrawal and J. R. Horgan. 1990. Dynamic program slicing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI90). 246-256.
2. J. Aldrich, V. Kostadinov, and C. Chambers. 2002. Alias annotations for program understanding. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA02). 311-330.
3. G. Ammons, J.-D. Choi, M. Gupta, and N. Swamy. 2004. Finding and removing performance bottlenecks in large systems. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP04). 172-196.
4. M. Arnold, S. Fink, D. Grove, M. Hind, and P. F. Sweeney. 2005. A survey of adaptive optimization in virtual machines. Proc. IEEE 92, 2, 449-466. (Pubitemid 40851235)
5. M. Arnold, M. Vechev, and E. Yahav. 2008. QVM: An efficient runtime for detecting defects in deployed systems. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA08). 143-162.
6. T. Ball and J. Larus. 1996. Efficient path profiling. In Proceedings of the International Symposium on Microarchitecture (MICRO96). 46-57.
7. S. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanovic, T. Vandrunen, D. Von Dincklage, and B. Wiedermann. 2006. The dacapo benchmarks: Java benchmarking development and analysis. In Proceedings of the ACMSIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA06). 169-190.
8. M. D. Bond and K. S.McKinley. 2005. Continuous path and edge profiling. In Proceedings of the International Symposium on Microarchitecture (MICRO05). 130-140. (Pubitemid 44500131)
9. M. D. Bond and K. S. McKinley. 2006. Bell: Bit-encoding online memory leak detection. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS06). 61-72.
10. M. D. Bond and K. S. McKinley. 2007. Probabilistic calling context. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA07). 97-112.
11. M. D. Bond, N. Nethercote, S.W. Kent, S. Z. Guyer, and K. S.McKinley. 2007. Tracking bad apples: Reporting the origin of null and undefined value errors. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA07). 405-422.
12. C. Boyapati, B. Liskov, and L. Shrira. 2003. Ownership types for object encapsulation. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL03). 213-223.
13. M. Burtscher and M. Jeeradit. 2003. Compressing extended program traces using value predictors. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT03). 159-169.
14. B. Calder, P. Feller, and A. Eustace. 1997. Value profiling. In Proceedings of the International Symposium on Microarchitecture (MICRO97). 259-269.
15. D. Chandra. 2006. Information flow analysis and enforcement in java bytecode. Ph.D. thesis, University of California, Irvine, CA.
16. D. Chandra and M. Franz. 2007. Fine-grained information flow analysis and enforcement in a java virtual machine. In Proceedings of the Annual Computer Security Applications Conference (ACSAC07). 463-475.
17. T. M. Chilimbi. 2001. Efficient representations and abstractions for quantifying and exploiting data reference locality. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI01). 191-202.
18. D. Clarke and S. Drossopoulou. 2002. Ownership, encapsulation and the disjointness of type and effect. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA02). 292-310.
19. J. Clause, W. Li, and A. Orso. 2007. Dytan: A generic dynamic taint analysis framework. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA07). 196-206. (Pubitemid 47317593)
20. B. Dufour, K. Driesen, L. Hendren, and C. Verbrugge. 2003. Dynamic metrics for java. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA03). 149-168.
21. B. Dufour, B. G. Ryder, and G. Sevitsky. 2007. Blended analysis for performance understanding of frameworkbased applications. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA07). 118-128. (Pubitemid 47317586)
22. B. Dufour, B. G. Ryder, and G. Sevitsky. 2008. A scalable technique for characterizing the usage of temporaries in framework-intensive java applications. In Proceedings of the ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE08). 59-70.
23. Ej-Technologies Gmbh. 2011. JProfiler. http://www.ej-technologies.com.
24. V. Haldar, D. Chandra, and M. Franz. 2005. Dynamic taint propagation for java. In Proceedings of the Annual Computer Security Applications Conference (ACSAC05). 303-311. (Pubitemid 46116486)
25. S. Han, Y. Dang, S. Ge, D. Zhang, and T. Xie. 2012. Performance debugging in the large via mining millions of stack traces. In Proceedings of the International Conference on Software Engineering (ICSE12). 145-155.
26. D. L. Heine and M. S. Lam. 2003. A practical flow-sensitive and context-sensitive c and c++ memory leak detector. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI03). 168-181.
27. J9 Java Virtual Machine. 2011. The j9 java virtual machine. http://wiki.eclipse.org/J9.
28. Q. Jacobson, E. Rotenberg, and J. E. Smith. 1997. Path-based next trace prediction. In Proceedings of the International Symposium on Microarchitecture (MICRO97). 14-23.
29. Java Development Blog. 2009. Java development blog. cld.blog-city.com.
30. Java Heap Analyzer Tool. 2014. Java heap analyzer tool (hat). http://hat.dev.java.net.
31. B. Korel and J. Laski. 1990. Dynamic slicing of computer programs. J. Syst. Softw. 13, 3, 187-195.
32. J. Krinke. 2003. Advanced slicing of sequential and concurrent programs. Ph.D. thesis, University of Passau.
33. J. Larus. 1999. Whole program paths. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI99). 259-269. (Pubitemid 129686094)
34. M. H. Lipasti and J. P. Shen. 1996. Exceeding the dataflow limit via value prediction. In Proceedings of the International Symposium on Microarchitecture (MICRO96). 226-237.
35. W. Masri and A. Podgurski. 2006. An empirical study of the strength of information flows in programs. In Proceedings of the International Workshop on Dynamic Analysis (WODA06). 73-80.
36. W. Masri and A. Podgurski. 2009. Measuring the strength of information flows in programs. ACM Trans. Softw. Engin. Methodol. 19, 2, 1-33.
37. A. Milanova, A. Rountev, and B. G. Ryder. 2005. Parameterized object sensitivity for points-to analysis for java. ACM Trans. Softw. Engin. Methodol. 14, 1, 1-41. (Pubitemid 40245820)
38. N. Mitchell. 2006. The runtime structure of object ownership. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP06). 74-98. (Pubitemid 44153402)
39. N. Mitchell, E. Schonberg, and G. Sevitsky. 2010. Four trends leading to java runtime bloat. IEEE Softw. 27, 1, 56-63.
40. N. Mitchell and G. Sevitsky. 2007. The causes of bloat, the limits of health. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA07). 245-260.
41. N. Mitchell, G. Sevitsky, and H. Srinivasan. 2006. Modeling runtime behavior in framework-based applications. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP06). 429-451. (Pubitemid 44153422)
42. S. K. Nair, P. N. Simpson, B. Crispo, and A. S. Tanenbaum. 2008. A virtual machine based information flow control system for policy enforcement. Electron. Notes Theor. Comput. Sci. 197, 1, 3-16. (Pubitemid 351253789)
43. N. Nethercote and J. Seward. 2007. How to shadow every byte of memory used by a program. In Proceedings of the ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE07). 65-74. (Pubitemid 47620964)
44. J. Newsome and D. Song. 2005. Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software. In Proceedings of the Annual Network and Distributed System Security Symposium (NDSS05).
45. K. Nguyen and G. Xu. 2013. Cachetor: Detecting cacheable data to remove bloat. In Proceedings of the ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE13). 268-278.
46. A. Nistor, L. Song, D. Marinov, and S. Lu. 2013. Toddler:Detecting performance problems via similarmemoryaccess patterns. In Proceedings of the International Conference on Software Engineering (ICSE13). 562-571.
47. F. Qin, C. Wang, Z. Li, H. Kim, Y. Zhou, and Y. Wu. 2006. Lift: A low-overhead practical information flow tracking system for detecting security attacks. In Proceedings of the International Symposium on Microarchitecture (MICRO06). 135-148.
48. Quest Software. 2011. JProbe memory debugging. http://www.quest.com/ jprobe.
49. D. Rayside and L. Mendel. 2007. Object ownership profiling: A technique for finding and fixingmemory leaks. In Proceedings of the International Conference on Automated Software Engineering (ASE07). 194-203.
50. S. Rubin, R. Bodik, and T. Chilimbi. 2002. An efficient profile-analysis framework for data-layout optimizations. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL02). 140-153. (Pubitemid 35017029)
51. O. Shacham, M. Vechev, and E. Yahav. 2009. Chameleon: Adaptive selection of collections. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI09). 408-418.
52. A. Shankar, M. Arnold, and R. Bodik. 2008. JOLT: Lightweight dynamic analysis and removal of object churn. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA08). 127-142.
53. O. Shivers. 1988. Control-flow analysis in scheme. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI88). 164-174.
54. M. Sridharan, S. J. Fink, and R. Bodik. 2007. Thin slicing. In Proceedings of the ACMSIGPLAN Conference on Programming Language Design and Implementation (PLDI07). 112-122. (Pubitemid 47630680)
55. K. Srinivas andH. Srinivasan. 2005. Summarizing application performance from a component perspective. In Proceedings of the ACMSIGSOFT International Symposium on the Foundations of Software Engineering (FSE05). 136-145. (Pubitemid 43218820)
56. Sun Java Forum. 2014. http://forums.java.net/jive/thread.jspa?messageID= 180784.
57. F. Tip. 1995. A survey of program slicing techniques. J. Program. Lang. 3, 121-189.
58. K. Vaswani, A. V. Nori, and T. M. Chilimbi. 2007. Preferential path profiling: Compactly numbering interesting paths. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL07). 351-362.
59. C. Wang and A. Roychoudhury. 2008. Dynamic slicing on java bytecode traces. ACM Trans. Program. Lang. Syst. 30, 2, 1-49.
60. X. Xiao, S. Han, T. Xie, and D. Zhang. 2013. Context-sensitive delta inference for identifying workloaddependent performance bottlenecks. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA13). 90-100.
61. G. Xu. 2011. Analyzing large-scale object-oriented software to find and remove runtime bloat. Ph.D. thesis, The Ohio State University.
62. G. Xu. 2012. Finding reusable data structures. In Proceedings of the ACMSIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA12). 1017-1034.
63. G. Xu. 2013a. CoCo: Sound and adaptive replacement of java collections. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP13). 1-26.
64. G. Xu. 2013b. Resurrector: Atunable object lifetime profiling technique for optimizing real-world programs. In Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA13). 111-130.
65. G. Xu, M. Arnold, N. Mitchell, A. Rountev, E. Schonberg, and G. Sevitsky. 2010a. Finding low-utility data structures. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI10). 174-186.
66. G. Xu, M. Arnold, N. Mitchell, A. Rountev, and G. Sevitsky. 2009. Go with the flow: Profiling copies to find runtime bloat. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI09). 419-430.
67. G. Xu, N.Mitchell, M. Arnold, A. Rountev, and G. Sevitsky. 2010b. Software bloat analysis: Finding, removing, and preventing performance problems in modern large-scale object-oriented applications. In Proceedings of the FSE/SDP Working Conference on the Future of Software Engineering Research (FoSER10). 421-426.
68. G. Xu and A. Rountev. 2008. Precise memory leak detection for java software using container profiling. In Proceedings of the International Conference on Software Engineering (ICSE08). 151-160.
69. W. Xu, S. Bhatkar, and R. Sekar. 2006. Taint-enhanced policy enforcement: A practical approach to defeat a wide range of attacks. In Proceedings of the 15th USENIX Security Symposium. 121-136.
70. D. Yan, G. Xu, and A. Rountev. 2012. Uncovering performance problems in java applications with reference propagation profiling. In Proceedings of the International Conference on Software Engineering (ICSE12). 134-144.
71. J. Yang and R. Gupta. 2002. Frequent value locality and its applications. ACM Trans. Program. Lang. Syst. 1, 1, 79-105.
72. X. Zhang. 2006. Fault localization via precise dynamic slicing. Ph.D. thesis, University of Arizona.
73. X. Zhang, N. Gupta, and R. Gupta. 2006a. Pruning dynamic slices with confidence. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI06). 169-180.
74. X. Zhang, N. Gupta, and R. Gupta. 2007. Locating faulty code by multiple points slicing. Softw. Pract. Exper. 37, 935-961. (Pubitemid 47116115)
75. X. Zhang and R. Gupta. 2004a. Cost effective dynamic program slicing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI04). 94-106.
76. X. Zhang and R. Gupta. 2004b.Whole execution traces. In Proceedings of the International Symposium on Microarchitecture (MICRO04). 105-116. (Pubitemid 40927690)
77. X. Zhang, R. Gupta, and Y. Zhang. 2003. Precise dynamic slicing algorithms. In Proceedings of the International Conference on Software Engineering (ICSE03). 319-329.
78. X. Zhang, S. Tallam, and R. Gupta. 2006b. Dynamic slicing long running programs through execution fast forwarding. In Proceedings of the ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE06). 81-91. (Pubitemid 47129387)
79. Y. Zhang and R. Gupta. 2001. Timestamped whole program path representation and its applications. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI01). 180-190.
80. Y. Zhang and R. Gupta. 2002. Data compression transformations for dynamically allocated data structures. In Proceedings of the International Conference on Compiler Construction (CC02). 14-28.