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 …

We study the control reachability problem in the Dolev-Yao model of cryptographic protocols
when principals are represented by tail recursive processes with generated names. We …

We consider the so called``cryptographic protocols``whose aim is to ensure some security
properties when communication channels are not reliable. Such protocols usually rely on …

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 …

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 …

We exhibit a rich class of Horn clauses, which we call H _ 1, whose least models, though
possibly infinite, can be computed effectively. We show that the least model of an H _ 1 …

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 …

The topic of set constraints is a pearl among the research topics on constraints. It combines
theoretical investigations (ranging from logical expressiveness, decidability, algorithms and …

We show that the first-order theory of structural subtyping of non-recursive types is
decidable, as a consequence of a more general result on the decidability of term powers of …

The main objective of this thesis is to understand why polymorphic subtype inference
systems may be inherently di cult to scale up. This is done through a study of the complexity …