Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify
expressions or prove equivalences. Developing rewrite rules can be difficult: rules may be …

This paper presents a novel formal semantics, mechanized in Coq, for a large, sequential
subset of the LLVM IR. In contrast to previous approaches, which use relationally-specified …

Abstract Domain-specific languages (DSLs) are prevalent across many application domains.
Such languages let developers easily express computations using high-level abstractions …

Halide is a domain-specific language for high-performance image processing and tensor
computations, widely adopted in industry. Internally, the Halide compiler relies on a term …

Extended Berkeley Packet Filter (BPF) has emerged as a powerful method to extend packet-
processing functionality in the Linux operating system. BPF allows users to write code in …

Rewrite rules are critical in equality saturation, an increasingly popular technique in
optimizing compilers, synthesizers, and verifiers. Unfortunately, developing high-quality …

Compilers should not miscompile. Peephole optimizations, which perform local rewriting of
the input program to improve the efficiency of generated code, are a persistent source of …

Extended Berkeley Packet Filter (BPF) is a language and run-time system that allows non-
superusers to extend the Linux and Windows operating systems by downloading user code …

This paper describes a research work on Semantic Inference, which can be regarded as an
extension of Grammar Inference. The main task of Grammar Inference is to induce a …

Program analysis tools apply elegant algorithms—such as static analysis, model checking,
and type inference—on source code to help developers resolve compiler errors, apply …