Related field analysis

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

Volumn , Issue , 2001, Pages 214-220

  Aggarwal, A ^a   Randall, K H ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM LISTINGS; DATA REDUCTION; DIGITAL LIBRARIES; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION; PROGRAM COMPILERS; SECURITY OF DATA;

ARRAY BOUNDS CHECKS; RELATED FIELD ANALYSIS;

JAVA PROGRAMMING LANGUAGE;

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

References (13)

1. ABCD: Eliminating array bounds checks on demand
2. Field analysis: Getting useful and low-cost interprocedural information
3. Compiler analysis for the value ranges of variables
4. Elimination of redundant array subscript range checks
5. Optimization of range checking
6. Accurate static branch prediction by value range propagation
7. Symbolic bounds analysis of pointers, array indices, and accessed memory regions
8. Implementation of an array bound checker
9. Safety checking of machine code