Joseph Izraelevitz

Joseph Izraelevitz

Auto-generated profile, based on publicly available information

Joseph Izraelevitz

University of Colorado, Boulder, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications

27 April 2024
Verified
Conference Paper
Open access
STSamuel Thomas
Samuel Thomas
KWKidus Workneh
Kidus Workneh
JMJac McCarty
Jac McCarty
JIJoseph Izraelevitz
Joseph Izraelevitz
TLTamara Lehman
Tamara Lehman
RBR. Iris Bahar
R. Iris Bahar
Secure memory is a highly desirable property to prevent memory corruption-based attacks. The emergence of nonvolatile, storage class memory (SCM) devices presents new challenges for secure memory. Metadata for integrity verification, organized in a Bonsai Merkle Tree (BMT), is cached on-chip in volatile caches, and may be lost on a power failure. As a consequence, care is required to ensure that metadata updates are always propagated into SCM. To optimize metadata updates, state-of-the-art approaches propose lazy update crash consistent metadata schemes. However, few consider the implications of their optimizations on on-chip area, which leads to inefficient utilization of scarce on-chip space. In this paper, we propose A Midsummer Night's Tree (AMNT), a novel "tree within a tree" approach to provide crash consistent integrity with low run-time overhead while limiting on-chip area for security metadata. Our approach offloads the potential hardware complexity of our technique to software to keep area overheads low. Our proposed mechanism results in significant improvements (a 41% reduction in execution overhead on average versus the state-of-the-art) for in-memory storage applications while significantly reducing the required on-chip area to implement our protocol.

8 January 2026 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
GAGuillaume Ambal
Guillaume Ambal
GHGeorge Hodgkins
George Hodgkins
MMMark Madler
Mark Madler
GCGregory Chockler
Gregory Chockler
BDBrijesh Dongol
Brijesh Dongol
VVViktor Vafeiadis
Viktor Vafeiadis
Remote Direct Memory Access (RDMA) is a memory technology that allows remote devices to directly write to and read from each other's memory, bypassing components such as the CPU and operating system. This enables low-latency high-throughput networking, as required for many modern data centres, HPC applications and AI/ML workloads. However, baseline RDMA comprises a highly permissive weak memory model that is difficult to use in practice and has only recently been formalised. In this paper, we introduce the Library of Composable Objects (LOCO), a formally verified library for building multi-node objects on RDMA, filling the gap between shared memory and distributed system programming. LOCO objects are well-encapsulated and take advantage of the strong locality and the weak consistency characteristics of RDMA. They have performance comparable to custom RDMA systems (e.g. distributed maps), but with a far simpler programming model amenable to formal proofs of correctness. To support verification, we develop a novel modular declarative verification framework, called Mowgli, that is flexible enough to model multinode objects and is independent of a memory consistency model. We instantiate Mowgli with the RDMA memory model, and use it to verify correctness of LOCO libraries.

20 June 2025
Verified
Conference Paper
Open access
HKHeewoo Kim
Heewoo Kim
SSSanjay Sri Vallabh Singapuram
Sanjay Sri Vallabh Singapuram
HYHaojie Ye
Haojie Ye
JIJoseph Izraelevitz
Joseph Izraelevitz
TMTrevor Mudge
Trevor Mudge
NTNishil Talati
Nishil Talati

20 July 2025
Verified
Conference Paper
Open access
MSMingyao Shen
Mingyao Shen
SMSuyash Mahar
Suyash Mahar
HKHeewoo Kim
Heewoo Kim
JIJoseph Izraelevitz
Joseph Izraelevitz
SSSteven Swanson
Steven Swanson

31 January 2024 in IEEE Computer Architecture Letters
Verified
Journal Article
Closed access
STSamuel Thomas
Samuel Thomas
KWKidus Workneh
Kidus Workneh
AIAnge-Thierry Ishimwe
Ange-Thierry Ishimwe
ZMZack McKevitt
Zack McKevitt
PCPhaedra Curlin
Phaedra Curlin
TLTamara Lehman
Tamara Lehman
Secure memory is a natural solution to hardware vulnerabilities in memory, but it faces fundamental challenges of performance and memory overheads. While significant work has gone into optimizing the protocol for performance, far less work has gone into optimizing its memory overhead. In this work, we propose the Baobab Merkle Tree, in which counters are memoized in an on-chip table. The Baobab Merkle Tree reduces spatial overhead of a Bonsai Merkle Tree by 2-4X without incurring performance overhead.