In this expository paper, we use automata for software model checking in a new way. The
starting point is to fix the alphabet: the set of statements of the given program. We show how …

We propose an automated verification technique for hypersafety properties, which express
sets of valid interrelations between multiple finite runs of a program. The key observation is …

We design an invariance proof method for concurrent programs parameterised by a weak
consistency model. The calculational design of the invariance proof method is by abstract …

Concurrent programs are still prone to bugs arising from the subtle interleavings of threads.
Traditional static analysis for concurrent programs, such as data-flow analysis and symbolic …

Program reductions are used widely to simplify reasoning about the correctness of
concurrent and distributed programs. In this paper, we propose a general approach to proof …

Pthread-style multithreaded programs feature rich thread communication mechanisms, such
as shared variables, signals, and broadcasts. In this article, we consider the automated …

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 jumping, a form of selective control-flow abstraction useful for improving the
scalability of goal-directed static analyses. Jumping is useful for analyzing programs with …

State Explosion is a fundamental challenge for model checking methods. This term refers to
the potentially exponential growth of the state space of a program as a function of the …

In this paper, we present a new approach to automatically verify multi-threaded programs
which are executed by an unbounded number of threads running in parallel. The starting …