(Enter summary)
Abstract: This paper presents a compiler optimization algorithm to reduce
the run time overhead of array subscript range checks
in programs without compromising safety. The algorithm
is based on partial redundancy elimination and it incorporates
previously developed algorithms for range check optimization.
We implemented the algorithm in our research
compiler, Nascent, and conducted experiments on a suite of
10 benchmark programs to obtain four results: (1) the execution
overhead of naive range checking... (Update)
Cited by: More
Dynamically Discovering Likely Program Invariants - Ernst (2000)
(Correct)
Elimination of Java Array Bounds Checks in the Presence of.. - Lujan, Gurd, al. (2004)
(Correct)
Symbolic Bounds Analysis of Pointers, Array Indices, and.. - Rugina, Rinard (2000)
(Correct)
Active bibliography (related documents): More All
0.2: From Flop to MegaFlops: Java for Technical Computing - Moreira, Midkiff, Gupta (1998)
(Correct)
0.2: Optimizing Array Reference Checking in Java Programs - Midkiff, Moreira, Snir (1998)
(Correct)
0.2: Efficient Intraprocedural Array Bound Checking - Nguyen, Irigoin, Ancourt..
(Correct)
Similar documents based on text: More All
0.2: Some Comments on Morel and Renvoise's `Global Optimization by.. - Sorkin
(Correct)
0.1: Beyond Induction Variables: Detecting and Classifying Sequences.. - Gerlek (1996)
(Correct)
0.1: A Multihoist Model For The Real Time Hoist Scheduling Problem - Lamothe Thierry And
(Correct)
Related documents from co-citation: More All
27: A fresh look at optimizing array bounds checking (context) - Gupta - 1990
19: Compiler analysis of the value ranges of variables (context) - Harrison - 1977
18: Optimizing array bound checks using flow analysis
- Gupta - 1993
BibTeX entry: (Update)
Priyadarshan Kolte and Michael Wolfe. Elimination of redundant array subscript range checks. SIGPLAN Notices, 30(6):270--278, June 1995. Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation. http://citeseer.ist.psu.edu/kolte95elimination.html More
@inproceedings{ kolte95elimination,
author = "Priyadarshan Kolte and Michael Wolfe",
title = "Elimination of Redundant Array Subscript Range Checks",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "270-278",
year = "1995",
url = "citeseer.ist.psu.edu/kolte95elimination.html" }
Citations (may not include all citations):
815
Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
415
Efficiently computing static single assignment form and the ..
- Cytron, Ferrante et al. - 1991
250
Automatic discovery of linear restraints among variables of ..
- Cousot, Halbwachs - 1978
128
Global optimization by suppression of partial redundancies (context) - Morel, Renvoise - 1979
104
Lazy code motion
- Knoop, Ruthing et al. - 1992
68
Beyond induction variables
- Wolfe - 1992
68
Beyond induction variables: Detecting and classifying sequen..
- Gerlek, Stoltz et al.
59
Compiler analysis for the value ranges for variables (context) - Harrison - 1977
50
A fresh look at optimizing array bound checking (context) - Gupta - 1990
45
Effective partial redundancy elimination
- Briggs, Cooper - 1994
41
Implementation of an array bound checker (context) - Suzuki, Ishihata - 1977
40
Optimizing array bound checks using flow analysis
- Gupta - 1993
32
Optimization of range checking (context) - Markstein, Cocke et al. - 1982
19
Automating proofs of the absence of common runtime errors (context) - German - 1978
17
Optimization of array subscript range checks (context) - Asuru - 1992
9
Data flow analysis and global optimization (context) - Morel - 1984
8
An optimizer for Ada -- design (context) - Schwarz, Kirchgassner et al. - 1988
7
Addison--Wesley (context) - Aho, Sethi et al. - 1986
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC