We address the verification problem of finite-state concurrent programs running under weak
memory models. These models capture the reordering of program (read and write) …

Abstract Model checkers based on Petri net coverability have been used successfully in
recent years to verify safety properties of concurrent shared-memory or asynchronous …

Context-bounded analysis has been shown to be both efficient and effective at finding bugs
in concurrent programs. According to its original definition, context-bounded analysis …

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

An asynchronous program is one that contains procedure calls which are not immediately
executed from the callsite, but stored and" dispatched" in a non-deterministic order by an …

Well-structured transition systems provide the right foundation to compute a finite basis of
the set of predecessors of the upward closure of a state. The dual problem, to compute a …

We describe a simple, conceptual forward analysis procedure for infinity-complete WSTS S.
This computes the so-called clover of a state. When S is the completion of a WSTS X, the …

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 …

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 …

In this paper, we present a general algorithmic schema called 'Expand, Enlarge and
Check'from which new algorithms for the coverability problem of WSTS can be constructed …