A REEXAMINATION OF OPTIMIZATION OF ARRAY SUBSCRIPT RANGE CHECKS

Authors
CHIN WN GOH EK
Citation
Wn. Chin et Ek. Goh, A REEXAMINATION OF OPTIMIZATION OF ARRAY SUBSCRIPT RANGE CHECKS, ACM transactions on programming languages and systems, 17(2), 1995, pp. 217-227
Citations number
4
Categorie Soggetti
Computer Sciences","Computer Science Software Graphycs Programming
Journal title
ACM transactions on programming languages and systems → ACNP
ISSN journal
01640925
Volume
17
Issue
2
Year of publication
1995
Pages
217 - 227
Database
ISI
SICI code
0164-0925(1995)17:2<217:AROOOA>2.0.ZU;2-3
Abstract
Jonathan Asuru proposed recently an enhanced method for optimizing arr ay subscript range checks. The proposed method is however unsafe and m ay generate optimized programs whose behavior is different from the or iginal program. Two main flaws in Asuru's method are described, togeth er with suggested remedies and improvements.