Bounded model checking (BMC) has successfully been used for many practical program
verification problems, but concurrency still poses a challenge. Here we describe a new …

This paper proposes a sound procedure to verify properties of communicating session
automata (csa), ie, communicating automata that include multiparty session types. We …

We address the problem of verifying message passing programs, defined as a set of
processes communicating through unbounded FIFO buffers. We introduce a bounded …

Asynchronous programs are notoriously difficult to reason about because they spawn
computation tasks which take effect asynchronously in a nondeterministic way. Devising …

Lazy-CSeq is a context-bounded verification tool for sequentially consistent C programs
using POSIX threads. It first translates a multi-threaded C program into a bounded …

Bounded verification techniques such as bounded model checking (BMC) have successfully
been used for many practical program analysis problems, but concurrency still poses a …

We describe a novel technique for bounded analysis of asynchronous message-passing
programs with ordered message queues. Our bounding parameter does not limit the number …

We describe a new sequentialization-based approach to the symbolic verification of
multithreaded programs with shared memory and dynamic thread creation. Its main novelty …

Sequentialization translates concurrent programs into equivalent nondeterministic
sequential programs so that the different concurrent schedules no longer need to be …

We study the formal language theory of multistack pushdown automata (MPA) restricted to
computations where a symbol can be popped from a stack S only if it was pushed within a …