Graph-based intermediate representations (IRs) are widely used for powerful compiler
optimizations, either interprocedurally in pure functional languages, or intraprocedurally in …

We describe a derivational approach to abstract interpretation that yields novel and
transparently sound static analyses when applied to well-established abstract machines. To …

Type-based model checking algorithms for higher-order recursion schemes have recently
emerged as a promising approach to the verification of functional programs. We introduce …

This paper advocates programming high-performance code using partial evaluation. We
present a clean-slate programming system with a simple, annotation-based, online partial …

Static program analysis is the art of reasoning about the behavior of computer programs
without actually running them. This is useful not only in optimizing compilers for producing …

In this functional pearl, we examine the use of definitional interpreters as a basis for abstract
interpretation of higher-order programming languages. As it turns out, definitional …

Low-level program analysis is a fundamental problem, taking the shape of" flow analysis" in
functional languages and" points-to" analysis in imperative and object-oriented languages …

Translating legacy system programs from C to Rust is a promising way to enhance their
reliability. To alleviate the burden of manual translation, automatic C-to-Rust translation is …

We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …

Abstract interpretation is a theory of abstraction and constructive approximation of the
mathematical structures used in the formal description of complex or infinite systems and the …