Compiler optimization decisions are often based on hand-crafted heuristics centered around
a few established benchmark suites. Alternatively, they can be learned from feature and …

Tracking specific events in a program's execution, such as object allocation or lock
acquisition, is at the heart of dynamic analysis. Despite the apparent simplicity of this task …

Compiler optimizations are often based on hand-crafted heuristics to guide the optimization
process. These heuristics are designed to benefit the average program and are otherwise …

Compilers provide many architecture-agnostic, high-level optimizations trading off peak
performance for code size. High-level optimizations typically cannot precisely reason about …

Compilers use a wide range of advanced optimizations to improve the quality of the machine
code they generate. In most cases, compiler optimizations rely on precise analyses to be …

Dynamic taint analysis (DTA) is a popular program analysis technique with applications to
diverse fields such as software vulnerability detection and reverse engineering. It consists of …

Although Graphics Processing Units (GPUs) have become pervasive for data-parallel
workloads, the efficient exploitation of their tiered memory hierarchy requires explicit …

Columnar databases are an established way to speed up online analytical processing
(OLAP) queries. Nowadays, data processing (eg, storage, visualization, and analytics) is …

Loop unrolling is a common compiler optimization technique that reduces the execution
count of loop branch instructions and improves program performance by merging multiple …

With the increasing popularity of Serverless computing and Function as a Service—where
typical workloads have a short lifetime—the research community is increasingly focusing on …