Sciweavers

193 search results - page 8 / 39
» Reasoning about Memory Layouts
Sort
View
SRDS
2003
IEEE
14 years 3 months ago
Transparent Runtime Randomization for Security
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...
Jun Xu, Zbigniew Kalbarczyk, Ravishankar K. Iyer
PLDI
1997
ACM
14 years 1 months ago
Data-centric Multi-level Blocking
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
Induprakas Kodukula, Nawaaz Ahmed, Keshav Pingali
TPHOL
2009
IEEE
14 years 4 months ago
Types, Maps and Separation Logic
Abstract. This paper presents a separation-logic framework for reasoning about low-level C code in the presence of virtual memory. We describe ract, generic Isabelle/HOL framework ...
Rafal Kolanski, Gerwin Klein
ASPLOS
1998
ACM
14 years 2 months ago
Compiler-Controlled Memory
Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a reasonable level...
Keith D. Cooper, Timothy J. Harvey
RTCSA
1999
IEEE
14 years 2 months ago
Hard Real-Time Garbage-Collection in the Jamaica Virtual Machine
Java's automatic memory management is the main reason that prevents Java from being used in hard realtime environments. We present the garbage collection mechanism that is us...
Fridtjof Siebert