During the past few years, several of us have been asked many times about references on
finite tree automata. On one hand, this is the witness of the liveness of this field. On the other …

SPASS: Combining Superposition, Sorts and Splitting Page 1 SPASS: Combining
Superposition, Sorts and Splitting Christoph Weidenbach Max-Planck-Institute for Computer …

The central component of standard approaches to compile-time program analysis is an
abstract domain for approximating program values. Importantly, the domain must be chosen …

Abstract Systems of set constraints are a natural formalism for many problems in program
analysis. Set constraints are also a generalization of tree automata. We present an algorithm …

A practical procedure for computing a regular approximation of a logic program is given.
Regular approximations are useful in a variety of tasks in debugging, program specialisation …

The authors investigate the relationship between set constraints and the monadic class of
first-order formulas and show that set constraints are essentially equivalent to the monadic …

Type analysis of Prolog is of primary importance for high-performance compilers, since type
information may lead to better indexing and to sophisticated specializations of unification …

A Haskell class C corresponds to a sequence f of (names of) functions. It denotes the set of
all types for which implementations of the functions in f have been provided 2]. The class …

Type analyses of logic programs which aim at inferring the types of the program being
analyzed are presented in a unified abstract interpretation-based framework. This covers …

Abstract Proof-Carrying Code (PCC) is a general approach to mobile code safety in which
programs are augmented with a certificate (or proof). The practical uptake of PCC greatly …