Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

We present a framework for the efficient application of stateless model checking (SMC) to
concurrent programs running under the Release-Acquire (RA) fragment of the C/C++ 11 …

We study the problem of verifying role-based multi-agent systems, where the number of
components cannot be determined at design time. We give a semantics that captures …

We present a simple and efficient framework for automatic verification of systems with a
parametric number of communicating processes. The processes may be organized in …

Infinite-state systems such as distributed protocols are challenging to verify using interactive
theorem provers or automatic verification tools. Of these techniques, deductive verification is …

It is well known that verification of safety properties of sequential programs is reducible to
satisfiability modulo theory of a first-order logic formula, called a verification condition (VC) …

A thread-modular proof for the correctness of a concurrent program is based on an inductive
and interference-free annotation of each thread. It is well-known that the corresponding …

We present a technique for automatically verifying safety properties of concurrent programs,
in particular programs that rely on subtle dependencies of local states of different threads …

We address the problem of verifying the reachability problem in programs running under the
formal model Px86 defined recently by Raad et al. in POPL'20 for the persistent Intel x86 …

We consider the model-checking problem for a particular class of parameterized systems:
systems that consist of arbitrary numbers of components. The task is to show correctness …