Hyperproperties have received increasing attention in the last decade due to their
importance eg for security analyses. Past approaches have focussed on synchronous …

Well-structured systems, aka WSTS, are computational models where the set of possible
configurations is equipped with a well-quasi-ordering which is compatible with the transition …

We survey some results on the automatic verification of parameterized programs without
identities. These are systems composed of arbitrarily many components, all of them running …

We study the safety verification problem for parameterized systems under the release-
acquire (RA) semantics. In the non-parameterized setting, access to atomic compare-and …

We consider parameterized verification of concurrent programs under the Total Store Order
(TSO) semantics. A program consists of a set of processes that share a set of variables on …

Automatic verification of threshold-based fault-tolerant distributed algorithms (FTDA) is
challenging: they have multiple parameters that are restricted by arithmetic conditions, the …

We study the almost-sure reachability problem in a distributed system obtained as the
asynchronous composition of N copies (called processes) of the same automaton (called …

We consider parameterized verification of systems executing according to the total store
ordering (TSO) semantics. The processes manipulate abstract data types over potentially …

We develop a static deadlock analysis for commercial Android Java applications, of sizes in
the tens of millions of LoC, under active development at Facebook. The analysis runs …

Verification of concurrent systems is a difficult problem in general, and this is the case even
more in a parametrized setting where unboundedly many concurrent components are …