Shape analysis

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

Volumn 1781, Issue , 2000, Pages 1-17

  Wilhelm, Reinhard ^a   Sagiv, Mooly ^b   Reps, Thomas ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b TEL AVIV UNIVERSITY   (Israel)

^c University of Wisconsin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPILE-TIME GARBAGE COLLECTION; INSTRUCTION SCHEDULING; PARALLELIZATIONS; SHAPE ANALYSIS;

PROGRAM COMPILERS;

EID: 84957024787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46423-9_1     Document Type: Conference Paper

References (25)

1. U. Assmann and M. Weinhardt. Interprocedural heap analysis for parallelizing imperative programs. In W. K. Giloi, S. Jähnichen, and B. D. Shriver, editors, Programming Models For Massively Parallel Computers, pages 74-82, Washington, DC, September 1993. IEEE Press.
2. D.R. Chase, M. Wegman, and F. Zadeck. Analysis of pointers and structures. In SIGPLAN Conf on Prog. Lang. Design and Impl., pages 296-310, New York, NY, 1990. ACM Press.
3. F. Corbera, R. Asenjo, and E.L. Zapata. New shape analysis techniques for automatic parallelization of C code. In International Computing Symposium, 1999.
4. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Symp on Princ of Prog. Lang., pages 238-252, New York, NY, 1977. ACM Press.
5. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In SIGPLAN Conf on Prog. Lang. Design and Impl., pages 2-241, New York, NY, 1994. ACM Press.
6. N. Dor, M. Rodeh, and M. Sagiv. Detecting memory errors via static pointer analysis. In Proceedings of the ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE’98), pages 27-34, June 1998. Available at “http://www.math.tau.ac.il/∼nurr/paste98.ps.gz”.
7. L. Hendren. Parallelizing Programs with Recursive Data Structures. PhD thesis, Cornell Univ., Ithaca, NY, Jan 1990.
8. L. Hendren, J. Hummel, and A. Nicolau. Abstractions for recursive pointer data structures: Improving the analysis and the transformation of imperative programs. In SIGPLAN Conf on Prog. Lang. Design and Impl., pages 249-260, New York, NY, June 1992. ACM Press.
9. L. Hendren and A. Nicolau. Parallelizing programs with recursive data structures. IEEE Trans. on Par. and Dist. Syst., 1(1):35-47, January 1990.
10. S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. In SIGPLAN Conf on Prog. Lang. Design and Impl., pages 28-40, New York, NY, 1989. ACM Press.
11. N.D. Jones and S.S. Muchnick. Flow analysis and optimization of Lisp-like structures. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 4, pages 102-131. Prentice-Hall, Englewood Cliffs, NJ, 1981.
12. N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Symp on Princ of Prog. Lang., pages 66-74, New York, NY, 1982. ACM Press.
13. W. Landi and B.G. Ryder. Pointer induced aliasing: A problem classification. In Symp on Princ of Prog. Lang., pages 93-103, New York, NY, January 1991. ACM Press.
14. J.R. Larus. Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors. PhD thesis, Univ. of Calif., Berkeley, CA, May 1989.
15. J.R. Larus and P.N. Hilfinger. Detecting conflicts between structure accesses. In SIGPLAN Conf on Prog. Lang. Design and Impl., pages 21-34, New York, NY, 1988. ACM Press.
16. T. Lev-Ami. TVLA: A framework for Kleene based static analysis. Master’s thesis, 2000.
17. F. Nielson, H. Riis Nielson, and C. Hankin. Principles of Program Analysis. Springer Verlag, 1999.
18. F. Nielson, H. Riis Nielson, and M. Sagiv. A Kleene analysis of mobile ambients. In Proceedings of ESOP’2000, 2000.
19. J. Plevyak, A.A. Chien, and V. Karamcheti. Analysis of dynamic structures for efficient parallel execution. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing, volume 768 of Lec. Notes in Comp. Sci., pages 37-57, Portland, OR, August 1993. Springer-Verlag.
20. J.L. Ross and M. Sagiv. Building a bridge between pointer aliases and program dependences. In Proceedings of the 1998 European Symposium On Programming, pages 221-235, March 1998. Available at “http://www.math.tau.ac.il/∼sagiv”.
21. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. In Symp on Princ of Prog. Lang., New York, NY, January 1996. ACM Press.
22. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. Trans. on Prog. Lang. and Syst., 20(1):1-50, January 1998.
23. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In Symp on Princ of Prog. Lang., 1999. Available at “http://www.cs.wisc.edu/wpis/papers/popl99.ps”.
24. J. Stransky. A lattice for abstract interpretation of dynamic (Lisp-like) structures. Inf and Comp., 101(1):70-102, Nov. 1992.
25. E. Y.-B. Wang. Analysis of Recursive Types in an Imperative Language. PhD thesis, Univ. of Calif., Berkeley, CA, 1994.