Publications related to Memory protection

Control-Flow Hijacking attacks are the dominant attack vector against C/C++ programs. Control-Flow Integrity (CFI) solutions mitigate these attacks on the forward edge, i.e., indirect calls through function pointers and virtual calls. Protecting the backwa ...

IEEE COMPUTER SOC2019

Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores

Willy Zwaenepoel, Diego Didona

This paper introduces the concept of size-aware sharding to improve tail latencies for in-memory key-value stores, and describes its implementation in the Minos key-value store. Size-aware sharding distributes requests for keys to cores according to the si ...

USENIX ASSOC2019

Composite Data Types in Dynamic Dataflow Languages as Copyless Memory Sharing Mechanism

Marco Mattavelli, Endri Bezati, Aurélien François Gilbert Bloch

This paper presents new optimization approaches aiming at reducing the impact of memory accesses on the performance of dataflow programs. The approach is based on introducing a high level management of composite data types in dynamic dataflow programming l ...

2019

In Search of Lost Bandwidth: Extensive Reordering of DRAM Accesses on FPGA

Paolo Ienne, Mikhail Asiatici, Gabor Andras Csordas

For efficient acceleration on FPGA, it is essential for external memory to match the throughput of the processing pipelines. However, the usable DRAM bandwidth decreases significantly if the access pattern causes frequent row conflicts. Memory controllers ...

IEEE COMPUTER SOC2019

Verifying Software Network Functions with No Verification Expertise

George Candea, Solal Vincenzo Pirelli, Rishabh Ramesh Iyer, Luis David Figueiredo Mascarenhas Moreira Pedrosa, Matteo Rizzo

We present the design and implementation of Vigor, a software stack and toolchain for building and running software network middleboxes that are guaranteed to be correct, while preserving competitive performance and developer productivity. Developers write ...

ACM2019

A Novel Centralized Strategy for Coded Caching with Non-uniform Demands

Michael Christoph Gastpar, Pierre Victor Xavier Quinton, Saeid Sahraei

Despite significant progress in the caching literature concerning the worst case and uniform average case regimes, the algorithms for caching with nonuniform demands are still at a basic stage and mostly rely on simple grouping and memory-sharing technique ...

2018

A Formally Verified NAT Stack

George Candea, Solal Vincenzo Pirelli, Arseniy Zaostrovnykh

Prior work proved a stateful NAT network function to be semantically correct, crash-free, and memory safe. Their toolchain verifies the network function code while assuming the underlying kernel-bypass framework, drivers, operating system, and hardware to ...

2018

A Formally Verified NAT Stack

George Candea, Solal Vincenzo Pirelli, Arseniy Zaostrovnykh

Prior work proved a stateful NAT network function to be, crash-free, memory safe and semantically correct [29]. Their toolchain verifies the network function code while assuming the underlying kernel-bypass framework, drivers, operating system, and hardwar ...

ASSOC COMPUTING MACHINERY2018

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.

Memory protection

SoK: Shining Light on Shadow Stacks

Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores

Composite Data Types in Dynamic Dataflow Languages as Copyless Memory Sharing Mechanism

In Search of Lost Bandwidth: Extensive Reordering of DRAM Accesses on FPGA

Verifying Software Network Functions with No Verification Expertise

A Novel Centralized Strategy for Coded Caching with Non-uniform Demands

Experiment and Machine Protection from Fast Losses caused by Crab Cavities in the High Luminosity LHC

A Formally Verified NAT Stack

A Formally Verified NAT Stack

Near-Memory Address Translation

Graph Chatbot

Chat with Graph Search

In Search of Lost Bandwidth: Extensive Reordering of DRAM Accesses on FPGA

SoK: Shining Light on Shadow Stacks

Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores

Composite Data Types in Dynamic Dataflow Languages as Copyless Memory Sharing Mechanism

Verifying Software Network Functions with No Verification Expertise

A Novel Centralized Strategy for Coded Caching with Non-uniform Demands

A Formally Verified NAT Stack

Experiment and Machine Protection from Fast Losses caused by Crab Cavities in the High Luminosity LHC

A Formally Verified NAT Stack

Near-Memory Address Translation