A Reexamination of “Optimization of Array Subscript Range Checks”

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 17, Issue 2, 1995, Pages 217-227

  Chin, Wei Ngan ^a   Goh, Eak Khoon ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Defense Science Organization ^*  (United States)

Author keywords

Backward checks propagation; integer programming; loop guard elimination; safe bound checks optimization

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEM RECOVERY; DATA HANDLING; ERROR ANALYSIS; INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROGRAM COMPILERS; RELIABILITY; SOFTWARE ENGINEERING;

BACKWARD CHECKS PROPAGATION; ERROR HANDLING; LOOP GUARD ELIMINATION; SAFE BOUND CHECKS OPTIMIZATION;

PROGRAM DEBUGGING;

EID: 0029275562     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/201059.201063     Document Type: Article

References (4)

1. Asuru, J. 1992. Optimization of array subscript range checks. ACM Lett. Prog. Lang. Syst. 1, 2 (June), 109-118.
2. Gupta, R. 1990. A fresh look at optimizing array bound checking. In ACM SZGPLAN Conference on Program Language Design and Implementation. ACM, New York, 272-282.
3. Gupta, R. 1993. Optimizing array bound checks using flow analysis. ACM Lett. Prog. Lang. Syst. 2, 1-4 (Mar.-Dec.), 135-150.
4. Markstein, V., Cooke, J., AND MARKSTEIN, P. 1982. Constant propagation with conditional branches. In ACM SIGPLAN Symposium on Compiler Construction. ACM, New York, 114-119.