In compiler research, polytopes and related mathematical objects have been successfully
used for several decades to represent and manipulate computer programs in an approach …

We introduce a robust semantics-driven technique for program equivalence checking. Given
two functions we find a trace alignment over a set of concrete executions of both programs …

Regression verification is an approach complementing regression testing with formal
verification. The goal is to formally prove that two versions of a program behave either …

We present a new library for extracting a polyhedral model from C source. The library is
based on clang, the LLVM C frontend, and isl, a library for manipulating quasi-affine sets …

Abstract mathematical representations such as integer polyhedra have been shown to be
useful to precisely analyze computational kernels and to express complex loop …

Dynamic Voltage and Frequency Scaling (DVFS) typically adapts CPU power consumption
by modifying a processor's operating frequency (and the associated voltage). Typical DVFS …

This paper considers the correctness of domain-specific compilers for tensor programming
languages through the study of Halide, a popular representative. It describes a translation …

We present a method for verifying relational program properties, that is, properties that relate
the input and the output of two programs. Our verification method is parametric with respect …

We address the problem of computing semantic differences between a program and a
patched version of the program. Our goal is to obtain a precise characterization of the …

High-level synthesis (HLS) can greatly facilitate the description of complex hardware
implementations, by raising the level of abstraction up to a classical imperative language …