Dennis Sprokholt

Dennis Sprokholt

Auto-generated profile, based on publicly available information

Dennis Sprokholt

TU Munich, Munich, Germany

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2025
Verified
Conference Paper
Open access
MFMartin Fink
Martin Fink
DSDimitrios Stavrakakis
Dimitrios Stavrakakis
DSDennis Sprokholt
Dennis Sprokholt
SCSoham Chakraborty
Soham Chakraborty
JEJan-Erik Ekberg
Jan-Erik Ekberg
PBPramod Bhatotia
Pramod Bhatotia
WebAssembly (WASM) is an immensely versatile and increasingly popular compilation target. It executes applications written in several languages (e.g., C/C++) with near-native performance in various domains (e.g., mobile, edge, cloud). Despite WASM's sandboxing feature, which isolates applications from other instances and the host platform, WASM does not inherently provide any memory safety guarantees for applications written in low-level, unsafe languages. To this end, we propose Cage, a hardware-accelerated toolchain for WASM that supports unmodified applications compiled to WASM and utilizes diverse Arm hardware features aiming to enrich the memory safety properties of WASM. Precisely, Cage leverages Arm's Memory Tagging Extension (MTE) to (i) provide spatial and temporal memory safety for heap and stack allocations and (ii) improve the performance of WASM's sandboxing mechanism. Cage further employs Arm's Pointer Authentication (PAC) to prevent leaked pointers from being reused by other WASM instances, thus enhancing WASM's security properties. We implement our system based on 64-bit WASM. We provide a WASM compiler and runtime with support for Arm's MTE and PAC. On top of that, Cage's LLVM-based compiler toolchain transforms unmodified applications to provide spatial and temporal memory safety for stack and heap allocations and prevent function pointer reuse. Our evaluation on real hardware shows that Cage incurs minimal runtime (<5.8%) and memory (<3.7%) overheads and can improve the performance of WASM's sandboxing mechanism, achieving a speedup of over 5.1%, while offering efficient memory safety guarantees.

22 March 2026
Verified
Conference Paper
Open access
SRSebastian Reimers
Sebastian Reimers
DSDennis Sprokholt
Dennis Sprokholt
MFMartin Fink
Martin Fink
TATheofilos Augoustis
Theofilos Augoustis
SKSimon Kammermeier
Simon Kammermeier
PBPramod Bhatotia
Pramod Bhatotia

24 July 2026
Verified
Book Chapter
Open access
DSDennis Sprokholt
Dennis Sprokholt
SCSoham Chakraborty
Soham Chakraborty
Burrow is a proof framework for weak memory mapping proofs. Those mappings appear as optimizations and translations between languages inside compilers and binary translators. However, their mechanized proofs, when defined over formal axiomatic weak memory semantics, are often large and complex. In this paper, we discuss the proof primitives provided by Burrow which simplify mechanizing those mapping proofs and help to prove many lemmas generally . To demonstrate the benefits of these primitives, we use Burrow to prove a mapping from x86 to Arm correct.

7 November 2026
Verified
Conference Paper
Open access
DSDennis Sprokholt
Dennis Sprokholt
RLReese Levine
Reese Levine
SSSusmit Sarkar
Susmit Sarkar
AGAndrés Goens
Andrés Goens
VNVijay Nagarajan
Vijay Nagarajan
SCSoham Chakraborty
Soham Chakraborty

6 November 2026
Verified
Conference Paper
Open access
TATheofilos Augoustis
Theofilos Augoustis
SRSebastian Reimers
Sebastian Reimers
CKChristian Krinitsin
Christian Krinitsin
RGRedha Gouicem
Redha Gouicem
DSDennis Sprokholt
Dennis Sprokholt
PBPramod Bhatotia
Pramod Bhatotia

7 November 2026
Verified
Conference Paper
Open access
SRSebastian Reimers
Sebastian Reimers
MFMartin Fink
Martin Fink
MEMarco Elver
Marco Elver
HLHernán Ponce de León
Hernán Ponce de León
DSDennis Sprokholt
Dennis Sprokholt
PBPramod Bhatotia
Pramod Bhatotia