This paper surveys recent work on applying analysis and transformation techniques that
originate in the field of constraint logic programming (CLP) to the problem of verifying …

A central concern for an optimizing compiler is the design of its intermediate representation
(IR) for code. The IR should make it easy to perform transformations, and should also afford …

We present a method for automatically generating verification conditions for a class of
imperative programs and safety properties. Our method is parametric with respect to the …

This article introduces a combinatorial optimization approach to register allocation and
instruction scheduling, two central compiler problems. Combinatorial optimization has the …

Anti-unification refers to the process of generalizing two (or more) goals into a single, more
general, goal that captures some of the structure that is common to all initial goals. In …

We investigate representations of imperative programs as constrained Horn clauses.
Starting from operational semantics transition rules, we proceed by writing interpreters as …

Clause sets saturated by hierarchic ordered resolution do not offer a model representation
that can be effectively queried, in general. They only offer the guarantee of the existence of a …

We introduce and evaluate an algorithm for an-style software model checker that operates
entirely at the level of equality with uninterpreted functions (EUF). Our checker, called …

In this work we provide an algorithm capable of searching for semantic clones in CLP
program code. Two code fragments are considered semantically cloned (at least to some …

Static analysis of logic programs by abstract interpretation requires designing abstract
operators which mimic the concrete ones, such as unification, renaming, and projection. In …