A reexamination of “Optimization of array subscript range checks”
- 1 March 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 17 (2) , 217-227
- https://doi.org/10.1145/201059.201063
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.Keywords
This publication has 2 references indexed in Scilit:
- Optimizing array bound checks using flow analysisACM Letters on Programming Languages and Systems, 1993
- Optimization of array subscript range checksACM Letters on Programming Languages and Systems, 1992