Skip to content
Open access

Supporting Memory Safety with a Security-Enhanced Memory Controller

2026 · Computers, Materials & Continua · 0 citations · 27 references

TL;DR

SerMC is proposed, a memory-controller-based tripwire mechanism that validates accesses when metadata arrives from Dynamic Random Access Memory and extends enforcement to DRAM-bound accesses issued by both processors and DMA-capable devices, and provides practical average-case overhead but still exposes a clear worst-case tradeoff when metadata traffic competes with demand memory requests.

Abstract

: Memory-unsafe languages such as C and C ++ remain widely used because they provide low-level control and high performance, but they remain vulnerable to spatial and temporal memory-safety violations such as out-of-bounds accesses, buffer overflows, and use-after-free errors. Prior hardware-assisted defenses reduce software overhead, yet many still rely on CPU-side metadata checks that add latency to the critical path and often miss DMA-originated accesses. We show that metadata-access cost is not dominated solely by DRAM latency: a substantial portion of the delay comes from on-chip traversal and cache-related processing. Motivated by this result, we propose SerMC, a memory-controller-based tripwire mechanism that validates accesses when metadata arrives from Dynamic Random Access Memory (DRAM) and extends enforcement to DRAM-bound accesses issued by both processors and DMA-capable devices. SerMC keeps metadata checks off the CPU critical path while preserving compatibility with existing C/C ++ programs. The design targets spatial and temporal violations that cross tripwire-protected DRAM regions; non-linear pointer corruption that avoids such regions and microarchitectural side channels remain outside the scope of the current design. Our evaluation on selected SPEC CPU workloads shows 9.25% average performance overhead, while the most memory-intensive workloads incur slowdowns of up to 50%. These results indicate that SerMC provides practical average-case overhead but still exposes a clear worst-case tradeoff when metadata traffic competes with demand memory requests.

Read PDF

Similar papers

Open access Aug 2026

MixSan: Enhancing Address-Based Memory Sanitizers with Fused Metadata and Hybrid Detection

MixSan, a prototype built on RangeSanitizer (RSan), stores the same identity tag in pointer high bits through Intel Linear Address Masking (LAM) U57 and validates both the tag and the spatial bound with a unified 3-ALU-op check.

Xiao-Yun Lu, Qiang Wei, Yun-Feng Wang et al. · 0 citations
Aug 2026

PMDangNull: Preventing use-After-Free for Persistent Memory Applications

Use-After-Free (UAF) remains one of the most critical security threats affecting C/C++ programs. Moreover, the cross-restart persistence semantics of persistent memory (PM) programming models significantly broaden the UAF attack surface. Existing DRAM-based protection schemes lack crash consistency guarantees, whereas...

Yuquan Chi, Yinjin Fu, Yong-Gang Hu et al. · 0 citations
Open access Aug 2026

Retention-Aware RISC-V ISA Extension and Memory Controller on FPGA for MLC NVM

This paper presents a novel memory controller architecture and a RISC-V instruction set extension to optimize MLC NVM write operations by balancing speed and retention time, and introduces a fast-store instruction in RISC-V to increasing write performance while addressing retention limitations.

Mina Ibrahim, M. Shokry, Lokesh Siddhu et al. · 0 citations
Book Open access Sep 2026

Hints for Program-Driven Control of Hybrid Volatile/Non-Volatile Caches

Compared to conventional volatile memory, non-volatile memory (NVM) technologies offer lower static power, higher density, and data retention. However, they induce high write overheads in terms of energy and potentially latency. Hybrid cache architectures mix volatile and non-volatile technologies, with the idea to kee...

Stefan Meißner, Stefan Wildermann, Neele Peter et al. · 0 citations
Book Open access Sep 2026

VoliStorM: A Crash-Consistent I/O Cache with Two Kernels Instead of Two Caches

A crash-consistent I/O cache is essential to ensure data integrity while optimizing performance. However, a general-purpose kernel fails to ensure integrity efficiently because of the high cost of synchronizing I/O requests with the many subsystems that rely on the cache. As a consequence, applications that must store...

Jana Toljaga, Nicolas Derumigny, Tara Aggoun et al. · 0 citations
Review Open access Aug 2026

User Privacy Attacks through Self-Modifying Code Conflicts

This paper systematically analyze a set of x86 instructions that directly or indirectly invalidate instruction cache lines, revealing measurable timing asymmetries between cache hits and misses, and shows that these SMC-induced timing artifacts can be leveraged to mount high-resolution cache attacks that are both steal...

Seonghun Son, Daniel Moghimi, Berk Gulmezoglu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.