Efficient alias set analysis using SSA form

International Symposium on Memory Management, ISMM

Volumn , Issue , 2009, Pages 79-88

  Naeem, Nomair A ^a   Lhoták, Ondřej ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Alias analysis; Dataflow analysis; Dominance; Live variables; Pointer analysis; Shape analysis; Static single assignment form

Indexed keywords

ALIAS ANALYSIS; BALANCED TREES; DOMINANCE RELATION; EFFICIENT DATA STRUCTURES; FLOW SENSITIVITY; FLOW-SENSITIVE ANALYSIS; HASH TABLE; LOCAL VARIABLES; MEMORY REQUIREMENTS; POINTER ANALYSIS; SET-BASED ANALYSIS; SHAPE ANALYSIS; STATIC SINGLE ASSIGNMENT FORM; STATIC SINGLE ASSIGNMENTS;

DATA STRUCTURES;

DATA FLOW ANALYSIS;

EID: 70450230740     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542431.1542443     Document Type: Conference Paper

References (26)

1. B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 1-11. ACM Press, 1988.
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'c, T. VanDrunen, D. von Dincklage, and B. Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. OOPSLA '06: Proceedings of Object-Oriented Programming, Systems, Languages and Applications, 2006.
3. S. Cherem and R. Rugina. Compile-time deallocation of individual objects. ISMM 06' Proceedings of the 2006 International Symposium on Memory Management, pages 138-149, 2006.
4. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1989.
5. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst., 13(4):451-490, 1991.
6. A. Deutsch. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. 4th International Conference on Computer Languages, pages 2-13, 1992.
7. B. Dufour. Objective quantification of program behaviour using dynamic metrics. Master's thesis, McGill University, June 2004.
8. S. Fink, E. Yahav, N. Dor, G. Ramalingam, and E. Geay. Effective typestate verification in the presence of aliasing. ISSTA '06: Proceedings of International Symposium on Software Testing and Analysis, pages 133-144, 2006.
9. S. J. Fink, E. Yahav, N. Dor, G. Ramalingam, and E. Geay. Effective typestate verification in the presence of aliasing. ACM Trans. Softw. Eng. Methodol., 17(2):1-34, 2008.
10. S. Hack and G. Goos. Optimal register allocation for SSA-form programs in polynomial time. Inf. Process. Lett., 98(4):150-155, 2006.
11. B. Hackett and R. Rugina. Region-based shape analysis with tracked locations. POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 310-323, 2005.
12. M. Hind. Pointer analysis: haven't we solved this problem yet? Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 54-61. ACM Press, 2001.
13. H. B. M. Jonkers. Abstract storage structures. de Bakker and van Vliet, editors, Algorithmic Languages, pages 321-343. IFIP, North Holland, 1981.
14. J. B. Kam and J. D. Ullman. Monotone data flow analysis frameworks. Acta Inf., 7:305-317, 1977.
15. O. Lhoták. Comparing call graphs. PASTE '07: Proceedings of 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 37-42, 2007.
16. N. A. Naeem and O. Lhoták. Extending typestate analysis to multiple interacting objects. Technical Report CS-2008-04, David R. Cheriton School of Computer Science, University of Waterloo, 2008. http: / /www. cs . uwaterloo. ca/research/tr / 200 8/CS-2 00 8-04.pdf.
17. N. A. Naeem and O. Lhoták. Typestate-like analysis of multiple interacting objects. OOPSLA '08: Proceedings of the 23rd ACM SIGPLAN conference on Object oriented programming systems languages and applications, pages 347-366, New York, NY, USA, 2008. ACM.
18. M. Odersky, L. Spoon, and B. Venners. Programming in Scala. Artima Press, first edition, 2008.
19. M. Orlovich and R. Rugina. Memory leak analysis by contradiction. K. Yi, editor, Static Analysis, 13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006, Proceedings, volume 4134 of Lecture Notes in Computer Science, pages 405-424. Springer, 2006.
20. T Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. POPL '95: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 49-61, 1995.
21. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. POPL '88: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1988.
22. B. G. Ryder. Dimensions of precision in reference analysis of object-oriented programming languages. G. Hedin, editor, Compiler Construction, 12th International Conference, CC 2003, volume 2622 of Lecture Notes in Computer Science, pages 126-137. Springer, 2003.
23. M. Sagiv, T Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems, 20(1):1-50, Jan. 1998.
24. 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, May 2002.
25. R. Vall'ee-Rai, E. Gagnon, L. J. Hendren, P. Lam, P. Pominville, and V. Sundaresan. Optimizing Java bytecode using the Soot framework: is it feasible? Compiler Construction, 9th International Conference (CC 2000), volume 1781 of Lecture Notes in Computer Science, pages 18-34, 2000.
26. M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. ACM Trans. Program. Lang. Syst., 13(2):181-210, 1991.