A Fresh Look at Optimizing Array Bound Checking

ACM SIGPLAN Notices

Volumn 25, Issue 6, 1990, Pages 272-282

  Gupta, Rajiv ^a  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Constant Propagation; Flow Analysis; Induction Variable Elimination; Minimal Control Flow Graph; Range Analysis

Indexed keywords

DATA PROCESSING - DATA STRUCTURES;

ARRAYS; OPTIMIZING COMPILERS;

COMPUTER OPERATING SYSTEMS;

EID: 0025446258     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/93548.93581     Document Type: Article

References (8)

1. A.V. Aho, R. Sethi, and J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986.
2. D. Callahan, K.D. Cooper, K. Kennedy, and L. Torczon, “Interprocedural Constant Propagation,” Proceedings 14th ACM Symposium on Principles of Programming Languages, pp. 152-161, 1986.
3. F. Chow, “A Portable Machine-independent Global Optimizer - Design and Measurements,” Ph.D. Thesis, Technical Report 83-254, Computer Sytems Lab, Stanford University, Dec., 1983.
4. W. Harrison, “Compiler Analysis of the Value Ranges for Variables,” IEEE Transactions on Software Engineering, vol. 3, no. 3, pp. 243-250, 1977.
5. J. Hennessy, “Symbolic Debugging of Optimized Code,” Trans. on Programming Languages and Systems, vol. 4, no. 3, pp. 323-344, July, 1982.
6. N. Suzuki and K. Ishihata, “Implementation of Array Bound Checker,” Proceedings 4th ACM Symposium on Principles of Programming Languages, pp. 132-143, 1977.
7. M.N. Wegman and F.K. Zadeck, “Constant Propagation with Conditional Branches,” Proceedings 12th ACM Symposium on Principles of Programming Languages, pp. 152-161, 1984.
8. V. Markstein, J. Cocke, and P. Markstein, “Optimization of Range Checking,” Proceedings of SIGPLAN'82 Symposium on Compiler Construction, 1982.