The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
SoftBound: highly compatible and complete spatial memory safety for c
Abstract
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's arbitrary pointer arithmetic, conflation of pointers and arrays, and programmer-visible memory layout make retrofitting C/C++ with spatial safety guarantees extremely challenging. Existing approaches suffer from incompleteness, have high runtime overhead, or require non-trivial changes to the C source code. Thus far, these deficiencies have prevented widespread adoption of such techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Abadi, M., Budiu, M., Erlingsson, Ú., & Ligatti, J. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102165 · Cited by 1,032
The Coq Proof Assistant - Reference Manual Version 6.1
Filliâtre, J.-C., Herbelin, H., Barras, B., Boutin, S., Giménez, E., Huet, G., Munoz, C. A., Cornes, C., Cornes, C., Courant, J., et al. (1997) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 979
Jim, T., Morrisett, J. G., Grossman, D., Hicks, M., Cheney, J., & Wang, Y.-L. (2002) · USENIX Annual Technical Conference · Cited by 866
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781153 · Cited by 573
Secure Execution Via Program Shepherding
Kiriansky, V., Bruening, D. L., & Amarasinghe, S. P. (2002) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 532
Efficient detection of all pointer and array access errors
Austin, T. M., Breach, S. E., & Sohi, G. S. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178446 · Cited by 427
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
Region-based memory management in cyclone
Grossman, D., Morrisett, G., Jim, T., Hicks, M., Wang, Y., & Cheney, J. (2002) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/512529.512563 · Cited by 403
Buffer overflows: attacks and defenses for the vulnerability of the decade
Cowan, C., Wagle, F., Pu, C., Beattie, S., & Walpole, J. (2002) · Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00 · doi:10.1109/discex.2000.821514 · Cited by 371
CCured: type-safe retrofitting of legacy software
Necula, G. C., Condit, J., Harren, M., McPeak, S., & Weimer, W. (2005) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1065887.1065892 · Cited by 365
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation · doi:10.1145/781131.781153 · Cited by 330
DieHard: probabilistic memory safety for unsafe languages
Berger, E. D., & Zorn, B. G. (2006) · Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1133981.1134000 · Cited by 272
ABCD: eliminating array bounds checks on demand
Bodík, R., Gupta, R., & Sarkar, V. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349342 · Cited by 234
Memory management with explicit regions
Gay, D., & Aiken, A. (1998) · Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation · doi:10.1145/277650.277748 · Cited by 212
Hardbound: architectural support for spatial safety of the C programming language
Devietti, J., Blundell, C., Martin, M. M. K., & Zdancewic, S. (2008) · Proceedings of the 13th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1346281.1346295 · Cited by 198
Self-citationBuffer overflows: attacks and defenses for the vulnerability of the decade
Cowan, C., Wagle, P., Pu, C., et al. (2004) · doi:10.1109/fits.2003.1264935 · Cited by 198
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
Criswell, J., Lenharth, A., Dhurjati, D., & Adve, V. (2007) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1294261.1294295 · Cited by 164
Dependent Types for Low-Level Programming
Condit, J., Harren, M., Anderson, Z., Gay, D. T., & Necula, G. C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-71316-6_35 · Cited by 153
Low-cost, Concurrent Checking of Pointer and Array Accesses in C Programs
Patil, H., & Fischer, C. N. (1997) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(199701)27:1<87::aid-spe78>3.0.co;2-p · Cited by 115
Dhurjati, D., Kowshik, S., & Adve, V. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1133999 · Cited by 111
Dhurjati, D., Kowshik, S., & Adve, V. (2006) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1133981.1133999 · Cited by 96
Memory safety without runtime checks or garbage collection
Dhurjati, D., Kowshik, S., Adve, V., & Lattner, C. (2003) · ACM SIGPLAN Notices · doi:10.1145/780731.780743 · Cited by 87
Memory safety without runtime checks or garbage collection
Dhurjati, D., Kowshik, S., Adve, V., & Lattner, C. (2003) · ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) · doi:10.1145/780732.780743 · Cited by 61
Beautiful Code. Leading Programmers Explain How They Think
(2009) · Journal of Workplace Learning · doi:10.1108/13665620910985568 · Cited by 43
Safe programming at the c level of abstraction
Morrisett, G., & Grossman, D. J. (2003) · Cited by 15
Cited by
Szekeres, L., Payer, M., Wei, T., & Song, D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.13 · Cited by 664
VC3: Trustworthy Data Analytics in the Cloud Using SGX
Schuster, F., Costa, M., Fournet, C., Gkantsidis, C., Peinado, M., Mainar-Ruiz, G., & Russinovich, M. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.10 · Cited by 595
(2021) · doi:10.1109/tse.2019.2946563 · Cited by 574
Bringing the web up to speed with WebAssembly
Haas, A., Rossberg, A., Schuff, D. L., Titzer, B. L., Holman, M., Gohman, D., Wagner, L., Zakai, A., & Bastien, J. (2017) · Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3062341.3062363 · Cited by 537
Practical Control Flow Integrity and Randomization for Binary Executables
Zhang, C., Wei, T., Chen, Z., Duan, L., Szekeres, L., McCamant, S., Song, D., & Zou, W. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.44 · Cited by 482
Metadata
- Authors
- Nagarakatte, S., Zhao, J., Martin, M. M. K., & Zdancewic, S.
- Venue
- Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2009-06-15
- Pages
- 245-258
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2155851497
- Cited by
- 521
- References
- 26
- FWCI
- 9.64
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.