Interprocedural may-alias analysis for pointers: Beyond k-limiting

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

Volumn , Issue , 1994, Pages 230-241

  Deutsch, Alain ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA HANDLING; OPTIMIZATION; PROGRAM COMPILERS; STORAGE ALLOCATION (COMPUTER);

ACCESS PATHS; MAY ALIAS ANALYSIS; POINTER DATA STRUCTURES; STORE BASED METHODS;

DATA STRUCTURES;

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

References (0)