Detecting inefficiently-used containers to avoid bloat

ACM SIGPLAN Notices

Volumn 45, Issue 6, 2010, Pages 160-173

  Xu, Guoqing ^a   Rountev, Atanas ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

CFL reachability; Container bloat; Points to analysis

Indexed keywords

BASE ANALYSIS; CFL REACHABILITY; CONTAINER BLOAT; DYNAMIC TOOLS; FALSE POSITIVE RATES; HIGH PRECISION; JAVA PROGRAM; PERFORMANCE PROBLEMS; POINTS-TO ANALYSIS; REACHABILITY; RUNTIMES; SOFTWARE SYSTEMS; STATIC AND DYNAMIC; STATIC TOOLS;

COMPUTER SOFTWARE; CONTEXT FREE LANGUAGES; JAVA PROGRAMMING LANGUAGE; SCALABILITY;

CONTAINERS;

EID: 77957582013     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1809028.1806616     Document Type: Conference Paper

References (46)

1. J. Aldrich, V. Kostadinov, and C. Chambers. Alias annotations for program understanding. In ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 311-330, 2002.
2. 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. Stefanović, T. VanDrunen, D. von Dincklage, and B. Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. In ACM SIGPLAN International Conference on Object- Oriented Programming, Systems, Languages, and Applications (OOP- SLA), pages 169-190, 2006.
3. M.D. Bond and K.S. McKinley. Bell: Bit-encoding online memory leak detection. In International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 61-72, 2006.
4. M.D. Bond and K.S. McKinley. Leak pruning. In International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 277-288, 2009.
5. C. Boyapati, B. Liskov, and L. Shrira. Ownership types for object encapsulation. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 213-223, 2003.
6. C. Calcagno, D. Distefano, P. OHearn, and H. Yang. Compositional shape analysis by means of bi-abduction. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 289-300, 2009.
7. B. Chang and X. Rival. Relational inductive shape analysis. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 247-260, 2008.
8. D. Clarke and S. Drossopoulou. Ownership, encapsulation and the disjointness of type and effect. In ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 292-310, 2002.
9. B. Dufour, B.G. Ryder, and G. Sevitsky. A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications. In ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE), pages 59-70, 2008.
10. C. Grothoff, J. Palsberg, and J. Vitek. Encapsulating objects with confined types. In ACM SIGPLAN International Conference on Object- Oriented Programming, Systems, Languages, and Applications (OOP- SLA), pages 241-255, 2001.
11. S. Gulwani, S. Jain, and E. Koskinen. Control-flow refinement and progress invariants for bound analysis. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 375-385, 2009.
12. S. Gulwani, K. Mehra, and T. Chilimbi. SPEED: Precise and efficient static estimation of program computational complexity. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Lan- guages (POPL), pages 127-139, 2009.
13. D.L. Heine and M.S. Lam. A practical flow-sensitive and contextsensitive C and C++ memory leak detector. In ACMSIGPLAN Confer- ence on Programming Language Design and Implementation (PLDI), pages 168-181, 2003.
14. D.L. Heine and M.S. Lam. Static detection of leaks in polymorphic containers. In International Conference on Software Engineering (ICSE), pages 252-261, 2006.
15. M. Jump and K.S. McKinley. Cork: Dynamic memory leak detection for garbage-collected languages. In ACM SIGPLAN-SIGACT Sympo- sium on Principles of Programming Languages (POPL), pages 31-38, 2007.
16. J. Kodumal and A. Aiken. The set constraint/CFL reachability connection in practice. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 207-218, 2004.
17. T. Lev-Ami, N. Immerman, T. Reps, M. Sagiv, and S. Srivastava. Simulating reachability using first-order logic with applications to verification of linked data structures. In International Conference on Automated Deduction (CADE), pages 99-115, 2005.
18. Y. Liu and A. Milanova. Ownership and immutability inference for UML-based object access control. In International Conference on Software Engineering (ICSE), pages 323-332, 2007.
19. Y. Liu and A. Milanova. Static analysis for inference of explicit information flow. In ACMSIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE), pages 50-56, 2008.
20. S. McPeak and G. Necula. Data structure specifications via local equality axioms. In International Conference on Computer Aided Verification (CAV), pages 476-490, 2005.
21. D. Melski and T. Reps. Interconvertibility of a class of set constraints and context-free-language reachability. Theoretical Computer Sci- ence, 248:29-98, 2000.
22. N. Mitchell, E. Schonberg, and G. Sevitsky. Four trends leading to Java runtime bloat. IEEE Software, 27(1):56-63, 2010.
23. N. Mitchell and G. Sevitsky. The causes of bloat, the limits of health. In ACM SIGPLAN International Conference on Object-Oriented Pro- gramming, Systems, Languages, and Applications (OOPSLA), pages 245-260, 2007.
24. N. Mitchell, G. Sevitsky, and H. Srinivasan. Modeling runtime behavior in framework-based applications. In European Conference on Object-Oriented Programming (ECOOP), pages 429-451, 2006.
25. M. Naik and A. Aiken. Conditional must not aliasing for static race detection. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 327-338, 2007.
26. G. Novark, E.D. Berger, and B.G. Zorn. Efficiently and precisely locating memory leaks and bloat. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 397-407, 2009.
27. J. Rehof and M. Fähndrich. Type-based flow analysis: From polymorphic subtyping to CFL-reachability. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 54-66, 2001.
28. T. Reps. Solving demand versions of interprocedural analysis problems. In International Conference on Compiler Construction (CC), pages 389-403, 1994.
29. T. Reps. Shape analysis as a generalized path problem. In ACM SIG- PLAN Symposium on Partial Evaluation and Semantics-based Pro- gram Manipulation (PEPM), pages 1-11, 1995.
30. T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11-12):701-726, 1998.
31. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In ACM SIGPLAN-SIGACT Sympo- sium on Principles of Programming Languages (POPL), pages 49-61, 1995.
32. T. Reps, S. Horwitz, M. Sagiv, and G. Rosay. Speeding up slicing. In ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE), pages 11-20, 1994.
33. A. Rountev, A. Milanova, and B.G. Ryder. Fragment class analysis for testing of polymorphism in Java software. IEEE Transactions on Software Engineering, 30(6):372-387, 2004.
34. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3):217-298, 1999.
35. O. Shacham, M. Vechev, and E. Yahav. Chameleon: Adaptive selection of collections. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 408-418, 2009.
36. A. Shankar, M. Arnold, and R. Bodik. JOLT: Lightweight dynamic analysis and removal of object churn. In ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 127-142, 2008.
37. M. Sridharan and R. Bodik. Refinement-based context-sensitive points-to analysis for Java. In ACM SIGPLAN Conference on Pro- gramming Language Design and Implementation (PLDI), pages 387- 400, 2006.
38. M. Sridharan, S.J. Fink, and R. Bodik. Thin slicing. In ACM SIG- PLAN Conference on Programming Language Design and Implemen- tation (PLDI), pages 112-122, 2007.
39. M. Sridharan, D. Gopan, L. Shan, and R. Bodik. Demand-driven points-to analysis for Java. In ACM SIGPLAN International Con- ference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 59-76, 2005.
40. Z. Su and D. Wagner. A class of polynomially solvable range constraints for interval analysis without widenings. Theoretical Computer Science, 345(1):122-138, 2005.
41. R. Vallée-Rai, E. Gagnon, L. Hendren, P. Lam, P. Pominville, and V. Sundaresan. Optimizing Java bytecode using the Soot framework: Is it feasible? In International Conference on Compiler Construction (CC), pages 18-34, 2000.
42. G. Xu, M. Arnold, N. Mitchell, A. Rountev, and G. Sevitsky. Go with the flow: Profiling copies to find runtime bloat. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 419-430, 2009.
43. G. Xu, N. Mitchell, M. Arnold, A. Rountev, E. Schonberg, and G. Sevitsky. Finding low-utility data structures. In ACM SIGPLAN Confer- ence on Programming Language Design and Implementation (PLDI), 2010.
44. G. Xu and A. Rountev. Precise memory leak detection for Java software using container profiling. In International Conference on Software Engineering (ICSE), pages 151-160, 2008.
45. G. Xu, A. Rountev, and M. Sridharan. Scaling CFL-reachability-based points-to analysis using context-sensitive must-not-alias analysis. In European Conference on Object-Oriented Programming (ECOOP), pages 98-122, 2009.
46. X. Zheng and R. Rugina. Demand-driven alias analysis for C. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 197-208, 2008.