Incrementalized pointer and escape analysis

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2001, Pages 35-46

  Vivien, F ^a   Rinard, M ^a  

^a UNIVERSITÉ DE STRASBOURG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; QUERY LANGUAGES; SOFTWARE ENGINEERING; SYNCHRONIZATION;

POINTER AND ESCAPE ANALYSIS;

COMPUTER PROGRAMMING;

EID: 0034832692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378795.378804     Document Type: Conference Paper

References (17)

1. The cartesian product algorithm: Simple and precise type inference of parametric polymorphism
2. Simultaneous demand-driven data-flow and call graph analysis
3. Escape analysis for object oriented languages, application to Java
4. Garbage collection in an uncooperative environment
5. Removing unnecessary synchronization in Java
6. Escape analysis for Java
7. A practical framework for demand-driven interprocedural data flow analysis
8. Optimizing the use of high performance libraries
9. Demand-driven interprocedural array property analysis
10. Demand interprocedural dataflow analysis
11. Points-to and side-effect analyses for programs built with precompiled libraries
12. Data-flow analysis of program fragments
13. Effective synchronization removal for Java
14. Design-directed compilation
15. Compositional pointer and escape analysis for Java programs
16. Incremental algorithms and empirical comparison for flow- and context-sensitive pointer aliasing analysis