Rastislav Bodik, Rajiv Gupta, Vivek Sarkar  Home/Search
Context Related
| ibm.com/jalapeno/papers/ABCD.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ibm.com/jalapeno/publication (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: To guarantee typesafe execution, Java and other strongly typed languages require bounds checking of array accesses. Because arraybounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or instruction scheduling of memory operations. Furthermore, because it is not expressible at bytecode level, the elimination of bounds checks can only be performed at run time, after the... (Update)
Cited by: More
Pointer-Range Analysis - Yong, Horwitz (2004) (Correct)
Reducing the Overhead of Dynamic Analysis - Yong, Horwitz (2002) (Correct)
Static Analysis and Computer Security: . . . - Wagner (2000) (Correct)
Active bibliography (related documents): More All
1.9: ABCD: Eliminating Array-Bounds Checks on Demand - Bodik, Gupta, Sarkar (2000) (Correct)
0.6: Path-Sensitive, Value-Flow Optimizations of Programs - Bodik (1999) (Correct)
0.4: Path-Sensitive Value-Flow Optimizations - Bodík (1998) (Correct)
Similar documents based on text: More All
0.5: Elimination of Java Array Bounds Checks in the.. - Lujan, Gurd, Freeman, .. (2002) (Correct)
0.2: Characterizing Coarse-Grained Reuse of Computation - Sastry, Bodik, Smith (2000) (Correct)
0.2: The Program Optimization Spectrum - Bodik (Correct)
Related documents from co-citation: More All
16: Elimination of redundant array subscript range checks - Kolte, Wolfe - 1995
13: Optimization of range checking (context) - Markstein, Cocke et al. - 1982
12: Symbolic Bounds Analysis of Pointers (context) - Rugina, Rinard - 2000
BibTeX entry: (Update)
R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating array bounds checks on demand. In Proceedings of the SIGPLAN '00 Conference on Program Language Design and Implementation, Vancouver, Canada, June 2000. http://citeseer.ist.psu.edu/bodik00abcd.html More
@inproceedings{ bodik00abcd,
author = "Rastislav Bodik and Rajiv Gupta and Vivek Sarkar",
title = "{ABCD}: eliminating array bounds checks on demand",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "321-333",
year = "2000",
url = "citeseer.ist.psu.edu/bodik00abcd.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1992
415 Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991
245 Graphs and Hypergraphs (context) - Berge - 1973
137 The design and implementation of a certifying compiler - Necula, Lee - 1998
110 Eliminating array bound checking through dependent types - Xi, Pfenning - 1998
104 Lazy code motion - Knoop, Ruthing et al. - 1992
62 The Jalapeno Dynamic Optimizing Compiler for Java - Burke, Choi et al. - 1999
61 Dependence-based program analysis - Johnson, Pingali - 1993
59 Compiler analysis for the value ranges of variables (context) - Harrison - 1977
59 Demand Interprocedural Dataflow Analysis - Horwitz, Reps et al. - 1995
53 Deciding Linear Inequalities by Computing Loop Residues (context) - Shostak - 1981
50 Elimination of redundant array subscript range checks - Kolte, Wolfe - 1995
50 A fresh look at optimizing array bound checking (context) - Gupta - 1990
49 An incremental algorithm for a generalization of the shortes.. - Ramalingam, Reps - 1996
45 Precise interprocedural dataflow analysis with applications .. - Sagiv, Reps et al. - 1996
43 Avoiding conditional branches by code replication (context) - Mueller, Whalley - 1995
41 Implementation of an array bound checker (context) - Suzuki, Ishihata - 1977
40 Optimizing array bound checks using flow analysis - Gupta - 1994
39 A fast and usually linear algorithm for global flow analysis (context) - Graham, Wegman - 1975
39 Accurate static branch prediction by value range propagation - Patterson - 1995
36 A new algorithm for partial redundancy elimination based on .. - Chow, Chan et al. - 1997
32 Optimization of range checking (context) - Markstein, Cocke et al. - 1982
31 Safety checking of machine code - Xu, Miller et al. - 2000
30 Array SSA form and its use in parallelization - Knobe, Sarkar - 1998
27 Automatic parallelization of divide and conquer algorithms - Rugina, Rinard - 1999
23 Complete removal of redundant expressions - Bodik, Gupta et al. - 1998
23 Discrete Applied Mathematics (context) - Gallo, Longo et al. - 1993
23 A practical framework for demand-driven interprocedural data.. - Duesterwald, Gupta et al. - 1997
22 Load-reuse analysis: Design and evaluation - Bodik, Gupta et al. - 1999
17 Optimization of array subscript range checks (context) - Asuru - 1992
17 Interprocedural conditional branch elimination - Bodik, Gupta et al. - 1997
16 Available as Technical Report CMU-CS (context) - Necula, Proofs et al. - 1998
15 Using static single assignment form to improve flow-insensit.. - Hasti, Horwitz - 1998
14 Global optimization by supression of partial redundancies (context) - Morel, Renviose - 1979
14 Optimizing bounds checking in Java programs (context) - Midkiff, Moreira et al. - 1998
11 Enabling sparse constant propagation of array elements via a.. (context) - Sarkar, Knobe - 1998
9 Detecting equalities of variables in programs (context) - Alpern, Wegman et al. - 1988
5 volume 1089 of Lecture Notes in Computer Science (context) - Ramalingam, computation - 1996
2 Two easy theories whose combinantion is hard (context) - Pratt - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.ibm.com/jalapeno/publication.html): More
Jalapeño - a Compiler-Supported Java.. - Alpern, Cocchi.. (1999) (Correct)
Dependence Analysis for Java - Chambers, Pechtchanski, Sarkar.. (1999) (Correct)
Linear Scan Register Allocation - Poletto, Sarkar (1999) (Correct)
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