The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
ABCD: eliminating array bounds checks on demand
Open accessAbstract
To guarantee typesafe execution, Java and other strongly typed languages require bounds checking of array accesses. Because array-bounds 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 bytecode program is loaded. Using existing powerful bounds-check optimizers at run time is not feasible, however, because they are too heavyweight for the dynamic compilation setting.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Automatic parallelization of divide and conquer algorithms
Rugina, R., & Rinard, M. (1999) · Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/301104.301111 · Cited by 103
Cited by
The software model checker Blast: Applications to software engineering
Beyer, D., Henzinger, T. A., Jhala, R., & Majumdar, R. (2007) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-007-0044-z · Cited by 585
SoftBound: highly compatible and complete spatial memory safety for c
Nagarakatte, S., Zhao, J., Martin, M. M. K., & Zdancewic, S. (2009) · Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1542476.1542504 · Cited by 521
Adaptive optimization in the Jalapeño JVM
Arnold, M., Fink, S., Grove, D., Hind, M., & Sweeney, P. F. (2000) · Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/353171.353175 · Cited by 257
Metadata
- Authors
- Bodík, R., Gupta, R., & Sarkar, V.
- Venue
- Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 2000-05
- Pages
- 321-333
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2130711572
- Cited by
- 234
- References
- 1
- FWCI
- 12.68
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: ABCD: eliminating array bounds checks on demand. https://app.cochat.ai/papers/10.1145/349299.349342
- The paper
- Bodík, R., Gupta, R., & Sarkar, V. (2000). ABCD: eliminating array bounds checks on demand. Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation. https://doi.org/10.1145/349299.349342
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.