The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.

SoftBound: Highly compatible and complete spatial memory safety for C

The work

AuthorsSantosh Nagarakatte; Jianzhou Zhao; Milo M. K. Martin; Steve Zdancewic
Editors
Typemisc
Year2009
Citekeynagarakatte2009softbound

Where it appeared

Published inProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation
Pages245--258

Identifiers

DOI10.1145/1542476.1542504
OpenAlexW2155851497

From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.

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.

How it got here

How it got hereagent via openalex
Added2026-10-25 20:13 UTC
Not denied bya person 2026-10-29 17:12 UTC

Cite it as

@misc{nagarakatte2009softbound,
  title        = {SoftBound: Highly compatible and complete spatial memory safety for C},
  author       = {Santosh Nagarakatte and Jianzhou Zhao and Milo M. K. Martin and Steve Zdancewic},
  year         = {2009},
  journal      = {Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation},
  pages        = {245--258},
  doi          = {10.1145/1542476.1542504},
}

This record lives at https://refs.drheap.org/nagarakatte2009softbound/ and will keep doing so.