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 …

This paper given an introduction to using set constraints to specify program analyses.
Several standard analysis problems are formulated using set constraints, which serves both …

Set constraints are relations between sets of terms. They have been used extensively in
various applications in program analysis and type inference. We present several results on …

We prove that trace equivalence is undecidable for the very small and natural subclass of
Petri nets in which no transition requires more than one token; this subclass corresponds …

Set constraints are a natural formalism for many problems that arise in program analysis.
This paper provides a brief introduction to set constraints: what set constraints are, why they …

We introduce a class of tree automata that perform tests on a memory that is updated using
function symbol application and projection. The language emptiness problem for this class …

Set constraints are relations between sets of terms. They have been used extensively in
various applications in program analysis and type inference. Recently, several algorithms for …

We introduce a new class of finite automata. They are usual bottom-up tree automata that
run on DAG representations of finite trees. We prove that the emptiness problem for this …

Systems of set constraints describe relations between sets of ground terms. They have been
successfully used in program analysis and type inference. In this paper we prove that the …

We introduce a class of tree automata that perform tests on a memory that is updated using
function symbol application and projection. The language emptiness problem for this class …