Demand-driven pointer analysis

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

Volumn , Issue , 2001, Pages 24-34

  Heintze, N ^a   Tardieu, O ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA FLOW ANALYSIS; DATA STRUCTURES; OPTIMAL SYSTEMS;

DEMAND-DRIVEN POINTER ANALYSIS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034837173     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Interprocedural May-Alias analysis for pointers: Beyond-k limiting
2. Context-sensitive interprocedural points-to analysis in the presence of function pointers
3. Partial online cycle elimination in inclusion constraint graphs
4. Off-line variable substitution for scaling points-to analysis
5. Projection merging: Reducing redundancies in inclusion constraint graphs
6. Program analysis and specialization for the C programming language
7. Points-to analysis in almost linear time
8. Fast and accurate flow-insensitive points-to analysis
9. Unification-based pointer analysis with directional assignments
10. Context-insensitive alias analysis reconsidered
11. Polymorphic versus monomorphic flow-insensitive points-to analysis for C
12. Demand-driven computation of interprocedural data flow
13. Ultra-fast pointer analysis using CLA: A million lines of C code in a second