Publication

Comprehensive Memory Safety Validation: An Alternative Approach to Memory Safety

Related publications (18)

Graph Chatbot

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.

Using Managed Runtime Systems to Tolerate Holes in Wearable Memories

James Richard Larus

New memory technologies, such as phase-change memory (PCM), promise denser and cheaper main memory, and are expected to displace DRAM. However, many of them experience permanent failures far more quickly than DRAM. DRAM mechanisms that handle permanent fai ...

ACM2013

Why Nothing Matters: The Impact of Zeroing

Jennifer Bedke Sartor, Xi Yang

Memory safety defends against inadvertent and malicious misuse of memory that may compromise program correctness and security. A critical element of memory safety is zero initialization. The direct cost of zero initialization is surprisingly high: up to 12 ...

2011

Memory Safety of Floating-Point Computations

Johannes Kinder

Concepts and technologies are described herein for determining memory safety of floating-point computations. The concepts and technologies described herein analyze code to determine if any floating-point computations exist in the code, and if so, if the fl ...

US Patent & Trademark Office2010

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

Concurrency and distribution pose algorithmic and implementation challenges in developing reliable distributed systems, making the field an excellent testbed for evaluating programming language and verification paradigms. Several specialized domain-specifi ...

2009

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

2009

Reflexes: programming abstractions for highly responsive computing in Java

Jesper Honig Spring

Achieving sub-millisecond response times in a managed language environment such as Java introduces significant implementation challenges. The Achilles' heel of Java is its reliance on automatic memory management for reclaiming dead objects. Typically, the ...

EPFL2008

Performance Evaluation of Barrier Techniques for Distributed Tracing Garbage Collector

David Atienza Alonso

Currently, software engineering is becoming even more complex due to distributed computing. In this new context, portability is one of the key issues and hence a cluster-aware Java Virtual Machine (JVM) that can transparently execute Java applications in a ...

Jon Von Neumann institute for computing (NIC)2005

Improving Fine-Grained Irregular Shared-Memory Benchmarks by Data Reordering

Willy Zwaenepoel

We demonstrate that data reordering can substantially improve the performance of fine-grained irregular sharedmemory benchmarks, on both hardware and software shared-memory systems. In particular, we evaluate two distinct data reordering techniques that se ...

2000