A reexamination of “Optimization of array subscript range checks”

Authors:
Wei-Ngan Chin;Eak-Khoon Goh
Affiliations:
National Univ. of Singapore, Singapore;Defense Science Organization, Singapore
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1995

Citing 4
Cited 4

A fresh look at optimizing array bound checking

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Optimization of array subscript range checks

ACM Letters on Programming Languages and Systems (LOPLAS)
Optimizing array bound checks using flow analysis

ACM Letters on Programming Languages and Systems (LOPLAS)
Optimization of range checking

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction

Optimizing Ada on the fly

Proceedings of the 1999 annual ACM SIGAda international conference on Ada
Elimination of Java array bounds checks in the presence of indirection

JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
Efficient and effective array bound checking

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for static and dynamic checking of C++ pointers

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Jonathan Asuru proposed recently an enhanced method for optimizing array subscript range checks. The proposed method is however unsafe and may generate optimized programs whose behavior is different from the original program. Two main flaws in Asuru's method are described, together with suggested remedies and improvements.