Automatic accurate live memory analysis for garbage-collected languages

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 8, 2001, Pages 102-111

  Unnikrishnan, Leena ^a   Stoller, Scott D ^a   Liu, Yanhong A ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17244377071     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/384196.384212     Document Type: Article

References (29)

1. P. Altenbernd. On the false path problem in hard real-time programs. In Proceedings of the 8th EuroMicro Workshop on Real-Time Systems, pages 102-107, L'Aquila, June 1996.
2. W.-N. Chin and S.-C. Khoo. Calculating sized types. In Proceedings of the ACM SIGPLAN 2000 Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 62-72. ACM, New York, Jan. 2000.
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press/McGraw-Hill, 1990.
4. K. Crary and S. Weirich. Resource bound certification. In Conference Record of the 27th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, Jan. 2000.
5. Proceedings of the 3rd European Symposium on Programming, volume 432 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, May 1990.
6. P. Flajolet, B. Salvy, and P. Zimmermann. Automatic average-case analysis of algorithms. Theoretical Computer Science, Series A, 79(1):37-109, Feb. 1991.
7. Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture. ACM, New York, Sept. 1989.
8. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: A compiler framework for analyzing and tuning memory behavior. A CM Trans. Program. Lang. Syst., 21(4):703-746, July 1999.
9. R. Henriksson. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Department of Computer Science, Lund University, Sept. 1998.
10. J. Hughes and L. Pareto. Recursion and dynamic data-structures in bounded space: Towards embedded ML programming. In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, pages 70-81. ACM, New York, Sept. 1999.
11. J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In Conference Record of the 23rd Annual ACM Symposium on Principles of Programming Languages, pages 410-423. ACM, New York, Jan. 1996.
12. K. Inoue, H. Seki, and H. Yagi. Analysis of functional programs to detect run-time garbage cells. ACM Trans. Program. Lang. Syst., 10(4):555-578, Oct. 1988.
13. T. P. Jensen and T. Mogensen. A backwards analysis for compile-time garbage collection. In ESOP 1990 [5], pages 227-239.
14. R. Jones and R. Lins. Garbage Collection : Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, New York, 1996.
15. S. B. Jones and D. Le Métayer. Compile-time garbage collection by sharing analysis. In FPCA 1989 [7], pages 54-74.
16. D. E. Knuth. The Art of Computer Programming, volume 1. Addison-Wesley, Reading, Mass., 1968.
17. Proceedings of the ACM SIGPLAN1999 Workshop on Languages, Compilers, and Tools for Embedded Systems. ACM, New York, May 1999.
18. D. Le Métayer. Ace: An automatic complexity evaluator. ACM Trans. Program. Lang. Syst., 10(2):248-266, Apr. 1988.
19. Y. A. Liu and G. Gómez. Automatic accurate time-bound analysis for high-level languages. In Proceedings of the ACM SIGPLAN 1998 Workshop on Languages, Compilers, and Tools for Embedded Systems, volume 1474 of Lecture Notes in Computer Science, pages 31-40. Springer-Verlag, June 1998.
20. M. Martonosi, A. Gupta, and T. Anderson. Effectiveness of trace sampling for performance debugging tools. In Proceedings of the 1993 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 248-259. ACM, New York, 1992.
21. C. Y. Park. Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems, 5:31-62, 1993.
22. P. Persson. Live memory analysis for garbage collection in embedded systems. In LCTES 1999 [17], pages 45-54.
23. W. Pugh. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Commun. ACM, 31(8), Aug. 1992.
24. M. Rosendahl. Automatic complexity analysis. In FPCA 1989 [7], pages 144-156.
25. I. Ryu. Issues and challenges in developing embedded software for information appliances and telecommunication terminals. In LCTES 1999 [17], pages 104-120. Invited talk.
26. D. Sands. Complexity analysis for a lazy higher-order language. In ESOP 1990 [5], pages 361-376.
27. L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Automatic accurate stack space and heap space analysis for high-level languages. Technical Report 538, Computer Science Dept., Indiana University, Apr. 2000.
28. R. Wilhelm and C. Ferdinand. On predicting data cache behaviour for real-time systems. In Proceedings of the ACM SIGPLAN 1998 Workshop on Languages, Compilers, and Tools for Embedded Systems, volume 1474 of Lecture Notes in Computer Science, pages 16-30. Springer-Verlag, June 1998.
29. P. Zimmermann and W. Zimmermann. The automatic complexity analysis of divide-and-conquer algorithms. In Computer and Information Sciences VI. Elsevier, 1991.