The runtime structure of object ownership

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4067 LNCS, Issue , 2006, Pages 74-98

  Mitchell, Nick ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; GRAPH THEORY; RESPONSE TIME (COMPUTER SYSTEMS); THRESHOLD LOGIC; TREES (MATHEMATICS);

AGGREGATE PATTERNS; MANUAL BROWSING; OBJECT CONNECTIVITY; PERFORMANCE GOALS;

OBJECT ORIENTED PROGRAMMING;

EID: 33746645978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785477_5     Document Type: Conference Paper

References (43)

1. Aldrich, J., Chambers, C.: Ownership domains: Separating aliasing policy from mechanism. In: The European Conference on Object-Oriented Programming. Volume 3086 of Lecture Notes in Computer Science., Oslo, Norway, Springer-Verlag (2004)
2. Aldrich, J., Kostadinov, V., Chambers, C.: Alias annotations for program understanding. In: Object-oriented Programming, Systems, Languages, and Applications. (2002)
3. Borland Software Corporation: OptimizeIt™ Enterprise Suite, http://www.borland.com/us/products/optimizeit (2005)
4. Boyapati, C., Lee, R., Rinard, M.: Ownership types for safe programming: preventing data races and deadlocks. In: Object-oriented Programming, Systems, Languages, and Applications. (2002)
5. Boyapati, C., Liskov, B., Shrira, L.: Ownership types for object encapsulation. In: Symposium on Principles of Programming Languages. (2003)
6. Clack, C., Clayman, S., Parrott, D.: Lexical profiling: Theory and practice. Journal of Functional Programming 5(2) (1995) 225-277
7. Clarke, D., Wrigstad, T.: External uniqueness is unique enough. In: The European Conference on Object-Oriented Programming. Volume 2743 of Lecture Notes in Computer Science., Springer-Verlag (2003) 176-200
8. Clarke, D.G., Noble, J., Potter, J.M.: Simple ownership types for object containment. In: The European Conference on Object-Oriented Programming. Volume 2072 of Lecture Notes in Computer Science., Budapest, Hungary, Springer-Verlag (2001) 53-76
9. Corbera, F., Asenjo, R., Zapata, E.L.: A framework to capture dynamic data structures in pointer-based codes. IEEE Transactions on Parallel and Distributed Systems 15(2) (2004) 151-166
10. De Pauw, W., Sevitsky, G.: Visualizing reference patterns for solving memory leaks in Java. Concurrency: Practice and Experience 12 (2000) 1431-1454
11. Dietl, W., Müller, P.: Universes: Lightweight ownership for JML. Special Issue: ECOOP 2004 Workshop FTfJP, Journal of Object Technology 4(8) (2005) 5-32
12. Ghiya, R., Hendren, L.J.: Is it a tree, a DAG, or a cyclic graph? a shape analysis for heap-directed pointers in c. In: Symposium on Principles of Programming Languages. (1996)
13. Hastings, R., Joynce, B.: Purify - fast detection of memory leaks and access errors. In: USENIX Proceedings. (1992) 125-136
14. Hill, T., Noble, J., Potter, J.: Scalable visualizations of object-oriented systems with ownership trees. Journal of Visual Languages and Computing 13 (2002) 319-339
15. Hirzel, M., Hinkel, J., Diwan, A., Hind, M.: Understanding the connectivity of heap objects. In: International Symposium on Memory Management. (2002)
16. Hitchens, R.: Java NIO. First edn. O'Reilly Media, Inc. (2002)
17. Holzner, S.: Eclipse. First edn. O'Reilly Media, Inc. (2004)
18. IBM Corporation: Rational PurifyPlus (2005)
19. Jeannet, B., Loginov, A., Reps, T., Sagiv, M.: A relational approach to interproce-dural shape analysis. In: International Static Analysis Symposium. Lecture Notes in Computer Science, New York, NY, Springer-Verlag (2004)
20. Lattner, C., Adve, V.: Data structure analysis: A fast and scalable context-sensitive heap analysis. Technical Report UIUCDCS-R-2003-2340, Computer Science Deptartment, University of Illinois (2003)
21. Lattner, C., Adve, V.: Automatic pool allocation: Improving performance by controlling data structure layout in the heap. In: Programming Language Design and Implementation, Chicago, IL (2005) 129-142
22. Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flow graph. ACM Transactions on Programming Languages and Systems 1(1) (1979) 121-141
23. Mitchell, N., Sevitsky, G.: Leakbot: An automated and lightweight tool for diagnosing memory leaks in large Java applications. In: The European Conference on Object-Oriented Programming. Volume 2743 of Lecture Notes in Computer Science., Springer-Verlag (2003) 351-377
24. Parkinson, M., Bierman, G.: Separation logic and abstraction. In: Symposium on Principles of Programming Languages. (2005)
25. Pheng, S., Verbrugge, C.: Dynamic shape and data structure analysis in Java. Technical Report 2005-3, School of Computer Science, McGill University (2005)
26. Pollet, I., Charlier, B.L., Cortesi, A.: Distinctness and sharing domains for static analysis of Java programs. In: The European Conference on Object-Oriented Programming. Volume 2072 of Lecture Notes in Computer Science., Springer-Verlag (2001) 77-98
27. Potanin, A.: The Fox -a tool for object graph analysis. Undergraduate Honors Thesis (2002)
28. Potanin, A., Noble, J., Biddle, R.: Checking ownership and confinement. Concurrency and Computation: Practice and Experience 16(7) (2004) 671-687
29. Potanin, A., Noble, J., Biddle, R.: Snapshot query-based debugging. In: Australian Software Engineering Conference, Melbourne, Australia (2004)
30. Potanin, A., Noble, J., Frean, M., Biddle, R.: Scale-free geometry in object-oriented programs. In: Communications of the ACM. (2005)
31. Quest Software: JProbe® Memory Debugger, http://www.quest.com/jprobe (2005)
32. Raman, E., August, D.I.: Recursive data structure profiling. In: ACM SIGPLAN Workshop on Memory Systems Performance. (2005)
33. Rayside, D., Mendel, L., Jackson, D.: A dynamic analysis for revealing object ownership and sharing. In: Workshop on Dynamic Analysis. (2006)
34. Rojemo, N., Runciman, C.: Lag, drag, void and use - heap profiling and space-efficient compilation revisited. In: International Conference on Functional Programming. (1996) 34-41
35. Runciman, C., Rojemo, N.: New dimensions in heap profiling. Journal of Functional Programming 6(4) (1996) 587-620
36. Sansom, P.M., Peyton Jones, S.L.: Time and space profiling for non-strict higher-order functional languages. In: Symposium on Principles of Programming Languages, San Francisco, CA (1995) 355-366
37. Sansom, P.M., Peyton Jones, S.L.: Formally based profiling for higher-order functional languages. ACM Transactions on Programming Languages and Systems 19(2) (1997) 334-385
38. Shaham, R., Kolodner, E.K., Sagiv, M.: Automatic removal of array memory leaks in Java. In: Computational Complexity. (2000) 50-66
39. Shaham, R., Kolodner, E.K., Sagiv, M.: Estimating the impact of heap liveness information on space consumption in Java. In: International Symposium on Memory Management. (2002)
40. Shaham, R., Kolodner, E.K., Sagiv, S.: Heap profiling for space-efficient Java. In: Programming Language Design and Implementation. (2001) 104-113
41. SPEC Corporation: The SPEC JVM Client98 benchmark suite, http://www.spec.org/osg/jvm98 (1998)
42. Sun Microsystems: Heap Analysis Tool, https://hat.dev.java.net/ (2002)
43. Sun Microsystems: HPROF JVM profiler. http://java.sun.com/developer/ technicalArticles/Programming/HPROF.html (2005)