Sharing memory pages between non-trusting processes is a common method of reducing
the memory footprint of multi-tenanted systems. In this paper we demonstrate that, due to a …

While code injection attacks have been virtually eliminated on modern systems, programs
today remain vulnerable to code reuse attacks. Particularly pernicious are Just-In-Time ROP …

Address Space Layout Randomization (ASLR) can increase the cost of exploiting memory
corruption vulnerabilities. One major weakness of ASLR is that it assumes the secrecy of …

The performance of compute hardware varies: software run repeatedly on the same server
(or a different server with supposedly identical parts) can produce performance results that …

The latest effective defense against code reuse attacks is fine-grained, per-process memory
randomization. However, such process randomization prevents code sharing since there is …

The aggressive optimization of floating-point computations is an important problem in high-
performance computing. Unfortunately, floating-point instruction sets have complicated …

Improving performance is a central concern for software developers. To locate optimization
opportunities, developers rely on software profilers. However, these profilers only report …

Virtual Machines (VMs) with Just-In-Time (JIT) compilers are traditionally thought to execute
programs in two phases: the initial warmup phase determines which parts of a program …

Modern computer systems are highly configurable, with the total variability space sometimes
larger than the number of atoms in the universe. Understanding and reasoning about the …

TPC-H continues to be the most widely used benchmark for relational OLAP systems. It
poses a number of challenges, also known as" choke points", which database systems have …