Elimination of redundant array subscript range checks
- 1 June 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 30 (6) , 270-278
- https://doi.org/10.1145/207110.207160
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Beyond induction variablesACM Transactions on Programming Languages and Systems, 1995
- 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
- Beyond induction variablesPublished by Association for Computing Machinery (ACM) ,1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- A fresh look at optimizing array bound checkingPublished by Association for Computing Machinery (ACM) ,1990
- Optimization of range checkingPublished by Association for Computing Machinery (ACM) ,1982
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977
- Implementation of an array bound checkerPublished by Association for Computing Machinery (ACM) ,1977