Publications related to Comprehensive Memory Safety Validation: An Alternative Approach to Memory Safety

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Preventing Use-After-Free Attacks with Fast Forward Allocation

Sanidhya Kashyap, Jungwon Lim

Memory-unsafe languages are widely used to implement critical systems like kernels and browsers, leading to thousands of memory safety issues every year. A use-after-free bug is a temporal memory error where the program accidentally visits a freed memory l ...

USENIX ASSOC2021

Low-Cost Side-Channel Secure Standard 6T-SRAM-Based Memory With a 1% Area and Less Than 5% Latency and Power Overheads

Robert Giterman

Side-channel attacks constitute a concrete threat to IoT systems-on-a-chip (SoCs). Embedded memories implemented with 6T SRAM macrocells often dominate the area and power consumption of these SoCs. Regardless of the computational platform, the side-channel ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Detailed Heap Profiling

James Richard Larus, Stuart Anthony Byma

Modern software systems heavily use the memory heap. As systems grow more complex and compute with increasing amounts of data, it can be difficult for developers to understand how their programs actually use the bytes that they allocate on the heap and whe ...

ACM2018

Detailed heap profiling

James Richard Larus, Stuart Anthony Byma

ACM2018

LMS-Verify: Abstraction without Regret for Verified Systems Programming’

Tiark Rompf, Nada Amin

Performance critical software is almost always developed in C, as programmers do not trust high-level languages to deliver the same reliable performance. This is bad because low-level code in unsafe languages attracts security vulnerabilities and because d ...

Assoc Computing Machinery2017

Approximate Computing With Unreliable Dynamic Memories

Andreas Peter Burg, Adam Shmuel Teman, Robert Giterman, Georgios Karakonstantis, Shrikanth Ganapathy

Embedded memories account for a large fraction of the overall silicon area and power consumption in modern SoC(s). While embedded memories are typically realized with SRAM, alternative solutions, such as embedded dynamic memories (eDRAM), can provide highe ...

2015

Code-Pointer Integrity

George Candea, Mathias Josef Payer, Volodymyr Kuznetsov

Systems code is often written in low-level languages like C/C++, which offer many benefits but also delegate memory management to programmers. This invites memory safety bugs that attackers can exploit to divert control flow and compromise the system. Depl ...

2014

Back to the Future: Fault-tolerant Live Update with Time-traveling State Transfer

Calin Iorgulescu

Live update is a promising solution to bridge the need to frequently update a software system with the pressing demand for high availability in mission-critical environments. While many research solutions have been proposed over the years, systems that all ...

The USENIX Association2013

Bridging Islands of Specialized Code using Macros and Reified Types

Nicolas Alexander Stucki, Vlad Ureche

Parametric polymorphism in Scala suffers from the usual drawback of erasure on the Java Virtual Machine: primitive values are boxed, leading to indirect access, wasteful use of heap memory and lack of cache locality. For performance-critical parts of the c ...

2013

Comprehensive Memory Safety Validation: An Alternative Approach to Memory Safety

Graph Chatbot

Chat with Graph Search

Preventing Use-After-Free Attacks with Fast Forward Allocation

Formal Verification of Rust with Stainless

Low-Cost Side-Channel Secure Standard 6T-SRAM-Based Memory With a 1% Area and Less Than 5% Latency and Power Overheads

Detailed Heap Profiling

Detailed heap profiling

LMS-Verify: Abstraction without Regret for Verified Systems Programming’

Approximate Computing With Unreliable Dynamic Memories

Code-Pointer Integrity

Back to the Future: Fault-tolerant Live Update with Time-traveling State Transfer

Bridging Islands of Specialized Code using Macros and Reified Types

Low-Cost Side-Channel Secure Standard 6T-SRAM-Based Memory With a 1% Area and Less Than 5% Latency and Power Overheads

Code-Pointer Integrity

Preventing Use-After-Free Attacks with Fast Forward Allocation

Formal Verification of Rust with Stainless

LMS-Verify: Abstraction without Regret for Verified Systems Programming’

Bridging Islands of Specialized Code using Macros and Reified Types

Detailed Heap Profiling

Back to the Future: Fault-tolerant Live Update with Time-traveling State Transfer

Approximate Computing With Unreliable Dynamic Memories

Detailed heap profiling