Couplings are a powerful mathematical tool for reasoning about pairs of probabilistic
processes. Recent developments in formal verification identify a close connection between …

Loop perforation is one of the most well known software techniques in approximate
computing. It transforms loops to periodically skip subsets of their iterations. It is general …

Industry standard implementations of math. h claim (often without formal proof) tight bounds
on floating-point errors. We demonstrate a novel static analysis that proves these bounds …

As we approach the limits of Moore's law, researchers are exploring new paradigms for
future high-performance computing (HPC) systems. Approximate computing has gained …

We propose ApproxHPVM, a compiler IR and system designed to enable accuracy-aware
performance and energy tuning on heterogeneous systems with multiple compute units and …

Semantics is traditionally concerned with program equivalence, in which all pairs of
programs which are not equivalent are treated the same, and simply dubbed as …

The aggressive optimization of heavily used kernels is an important problem in high-
performance computing. However, both general purpose compilers and highly specialized …

We present Bolt, a novel system for escaping from infinite and long-running loops. Directed
by a user, Bolt can attach to a running process and determine if the program is executing an …

Improving the performance of deep neural networks (DNNs) is important to both the compiler
and neural architecture search (NAS) communities. Compilers apply program …

We present Dubstep, a novel system that uses the find-transform-navigate paradigm to
automatically explore new parallelization opportunities in already parallelized (fully …