Combined modeling and verification of dynamic systems and the data they operate on has
gained momentum in AI and in several application domains. We investigate the expressive …

In this article, we study the complexity of the problems: given a loop, described by linear
constraints over a finite set of variables, is there a linear or lexicographical-linear ranking …

In this paper we study the complexity of the Linear Ranking problem: given a loop, described
by linear constraints over a finite set of integer variables, is there a linear ranking function for …

We study monitoring of linear-time arithmetic properties against finite traces generated by an
unknown dynamic system. The monitoring state is determined by considering at once the …

The analysis of complex dynamic systems is a core research topic in formal methods and AI,
and combined modelling of systems with data has gained increasing importance in …

In this article we study the decidability of termination of several variants of simple integer
loops, without branching in the loop body and with affine constraints as the loop guard (and …

The integrated modeling and analysis of dynamic systems and the data they manipulate has
been long advocated, on the one hand, to understand how data and corresponding …

We introduce the class of tree constraint automata with data values in Z (equipped with the
less than relation and equality predicates to constants) and we show that the nonemptiness …

The goal of parameterized verification is to prove the correctness of a system specification
regardless of the number of its components. The problem is of interest in several different …

We prove a general finite-time convergence theorem for fixpoint expressions over a well-
quasi-ordered set. This has immediate applications for the verification of well-structured …