Elimination of redundant array subscript range checks
- 1 June 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 30 (6) , 270-278
- https://doi.org/10.1145/223428.207160
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Beyond induction variablesACM Transactions on Programming Languages and Systems, 1995
- Effective partial redundancy eliminationPublished by Association for Computing Machinery (ACM) ,1994
- 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
- Lazy code motionPublished 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
- Automating proofs of the absence of common runtime errorsPublished by Association for Computing Machinery (ACM) ,1978
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977