The DOI matches its Crossref record.
DieHarder: securing the heap
Abstract
Heap-based attacks depend on a combination of memory management error and an exploitable memory allocator. Many allocators include ad hoc countermeasures against particular exploits but their effectiveness against future exploits has been uncertain. This paper presents the first formal treatment of the impact of allocator design on security. It analyzes a range of widely-deployed memory allocators, including those used by Windows, Linux, FreeBSD and OpenBSD, and shows that they remain vulnerable to attack. It them presents DieHarder, a new allocator whose design was guided by this analysis. DieHarder provides the highest degree of security from heap-based attacks of any practical allocator of which we are aware while imposing modest performance overhead. In particular, the Firefox web browser runs as fast with DieHarder as with the Linux allocator.
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
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
Just-In-Time Code Reuse: On the Effectiveness of Fine-Grained Address Space Layout Randomization
Snow, K. Z., Monrose, F., Davi, L., Dmitrienko, A., Liebchen, C., & Sadeghi, A. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.45 · Cited by 505
SoK: Automated Software Diversity
Larsen, P., Homescu, A., Brunthaler, S., & Franz, M. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.25 · Cited by 321
No Need to Hide: Protecting Safe Regions on Commodity Hardware
Koning, K., Chen, X., Bos, H., Giuffrida, C., & Athanasopoulos, E. (2017) · Proceedings of the Twelfth European Conference on Computer Systems · doi:10.1145/3064176.3064217 · Cited by 116
Metadata
- Authors
- Novark, G., & Berger, E. D.
- Venue
- Proceedings of the 17th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2010-10-04
- Pages
- 573-584
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2154795299
- Cited by
- 204
- References
- 0
- FWCI
- 9.36
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DieHarder: securing the heap. https://app.cochat.ai/papers/10.1145/1866307.1866371
- The paper
- Novark, G., & Berger, E. D. (2010). DieHarder: securing the heap. Proceedings of the 17th ACM conference on Computer and communications security. https://doi.org/10.1145/1866307.1866371
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.