Well-structured transition systems form a large class of infinite-state systems, for which safety
verification is decidable thanks to a generic backward coverability algorithm. However, for …

Rackoff's small witness property for the coverability problem is the standard means to prove
tight upper bounds in vector addition systems (VAS) and many extensions. We show how to …

In this dissertation, we study the verification of concurrent programs written in the
programming language Erlang using infinite-state model-checking. Erlang is a widely used …