The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Efficient detection of all pointer and array access errors
Open accessAbstract
We present a pointer and array access checking technique that provides complete error coverage through a simple set of program transformations. Our technique, based on an extended safe pointer representation, has a number of novel aspects. Foremost, it is the first technique that detects all spatial and temporal access errors. Its use is not limited by the expressiveness of the language; that is, it can be applied successfully to compiled or interpreted languages with subscripted and mutable pointers, local references, and explicit and typeless dynamic storage management, e.g., C. Because it is a source level transformation, it is amenable to both compile- and run-time optimization. Finally, its performance, even without compile-time optimization, is quite good. We implemented a prototype translator for the C language and analyzed the checking overheads of six non-trivial, pointer intensive programs. Execution overheads range from 130% to 540%; with text and data size overheads typically below 100%.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,082
An empirical study of the reliability of UNIX utilities
Miller, B. P., Fredriksen, L., & So, B. (1990) · Communications of the ACM · doi:10.1145/96267.96279 · Cited by 1,281
Garbage collection in an uncooperative environment
Boehm, H., & Weiser, M. (1988) · Software: Practice and Experience · doi:10.1002/spe.4380180902 · Cited by 627
Sullivan, M., & Chillarege, R. (2002) · [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium · doi:10.1109/ftcs.1991.146625 · Cited by 346
Space efficient conservative garbage collection
Boehm, H.-J. (1993) · Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation · doi:10.1145/155090.155109 · Cited by 174
A fresh look at optimizing array bound checking
Gupta, R. (1990) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/93542.93581 · Cited by 77
SMART POINTERS: THEY''RE SMART, BUT THEY''RE NOT POINTERS
Edelson, D. R. (1992) · Cited by 42
A Memory Allocation Profiler for C and Lisp Programs
Zorn, B. G., & Hilfinger, P. N. (1988) · Cited by 37
Topics in advanced language implementation
Tracey, S. (1992) · Information and Software Technology · doi:10.1016/0950-5849(92)90151-e · Cited by 35
Cited by
Collaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
The oracle problem in software testing: A survey
Barr, E. T., Harman, M., McMinn, P., Shahbaz, M., & Yoo, S. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2014.2372785 · Cited by 1,104
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
DieHard: probabilistic memory safety for unsafe languages
Berger, E. D., & Zorn, B. G. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134000 · Cited by 405
A practical approach to programming with assertions
Rosenblum, D. S. (1995) · IEEE Transactions on Software Engineering · doi:10.1109/32.341844 · Cited by 334
Metadata
- Authors
- Austin, T. M., Breach, S. E., & Sohi, G. S.
- Venue
- Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 1994-06
- Pages
- 290-301
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W1973326708
- Cited by
- 427
- References
- 9
- FWCI
- 7.81
- 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: Efficient detection of all pointer and array access errors. https://app.cochat.ai/papers/10.1145/178243.178446
- The paper
- Austin, T. M., Breach, S. E., & Sohi, G. S. (1994). Efficient detection of all pointer and array access errors. Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation. https://doi.org/10.1145/178243.178446
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.