Static analysis of accessed regions in recursive data structures

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

Volumn 2694, Issue , 2003, Pages 463-482

  Chong, Stephen ^a   Rugina, Radu ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; CONCRETES; DATA STRUCTURES; GRAPH THEORY; STATIC ANALYSIS;

ANALYSIS ALGORITHMS; DIFFERENT SHAPES; PROGRAM POINTS; REACHABILITY; RECURSIVE DATA STRUCTURES; REGION INFORMATION; SHAPE GRAPH; SINGLE ENTRY;

TREES (MATHEMATICS);

EID: 35248883421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44898-5_26     Document Type: Article

References (18)

1. D. Chase, M. Wegman, and F. Zadek. Analysis of pointers and structures. In Proceedings of the SIGPLAN'90 Conference on Program Language Design and Implementation, White Plains, NY, June 1990.
2. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In Proceedings of the SIGPLAN'94 Conference on Program Language Design and Implementation, Orlando, FL, June 1994.
3. N. Dor, M. Rodeh, and M. Sagiv. Checking cleanness in linked lists. In Proceedings of the 8th International Static Analysis Symposium, Santa Barbara, CA, July 2000.
4. M. Emami, R. Ghiya, and L. Hendren. Context-sensitive interprocedural points to analysis in the presence of function pointers. In Proceedings of the SIGPLAN'94 Conference on Program Language Design and Implementation, Orlando, FL, June 1994.
5. R. Ghiya and L. Hendren. Connection analysis: A practical interprocedural heap analysis for C. In Proceedings of the Eighth Workshop on Languages and Compilers for Parallel Computing, Columbus, OH, August 1995.
6. R. Ghiya and L. Hendren. Is is a tree, a DAG or a cyclic graph? A shape analysis for heap-directed pointers in C. In Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages, St. Petersburg Beach, FL, January 1996.
7. L. Hendren, J. Hummel, and A. Nicolau. Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs. In Proceedings of the SIGPLAN '92 Conference on Program Language Design and Implementation, San Francisco, CA, June 1992.
8. L. Hendren, J. Hummel, and A. Nicolau. A general data dependence test for dynamic, pointer-based data structures. In Proceedings of the SIGPLAN'94 Conference on Program Language Design and Implementation, Orlando, FL, June 1994.
9. L. Hendren and A. Nicolau. Parallelizing programs with recursive data structures. IEEE Transactions on Parallel and Distributed Systems, 1(1):35-47, January 1990.
10. N. Jones and S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the 9th Annual ACM Symposium on the Principles of Programming Languages, Albuquerque, NM, January 1982.
11. J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Proceedings of the SIGPLAN'88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988.
12. T. Lev-ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In 2000 International Symposium on Software Testing and Analysis, August 2000.
13. N. Rinetzky and M. Sagiv. Interprocedural shape analysis for recursive programs. In Proceedings of the 2001 International Conference on Compiler Construction, Genova, Italy, April 2001.
14. R. Rugina and M. Rinard. Pointer analysis for multithreaded programs. In Proceedings of the SIGPLAN'99 Conference on Program Language Design and Implementation, Atlanta, GA, May 1999.
15. 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, January 1998.
16. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In Proceedings of the 26th Annual ACM Symposium on the Principles of Programming Languages, San Antonio, TX, January 1999.
17. R. Wilhelm, M. Sagiv, and T. Reps. Shape analysis. In Proceedings of the 2000 International Conference on Compiler Construction, Berlin, Germany, April 2000.
18. R. Wilson and M. Lam. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the SIGPLAN'95 Conference on Program Language Design and Implementation, La Jolla, CA, June 1995.