Device drivers rely on fine-grained locking to ensure safe access to shared data structures.
For human testers, concurrency makes such code notoriously hard to debug; for automated …

Validation of Android apps via testing is difficult owing to the presence of flaky tests. Due to
non-deterministic execution environments, a sequence of events (a test) may lead to …

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 model checking is among the most efficient techniques for the automated
verification of concurrent programs. However, due to the nondeterministic thread …

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 present a static deadlock analysis approach for C/pthreads. The design of our method
has been guided by the requirement to analyse real-world code. Our approach is sound (ie …

A Prototype for Data Race Detection in CSeq 3 Page 1 A Prototype for Data Race Detection
in CSeq 3⋆ (Competition Contribution) Alex Coto, Omar Inverso, Emerson Sales, and …

Validation of Android apps via testing is difficult owing to the presence of flaky tests. Due to
non-deterministic execution environments, a sequence of events (a test) may lead to …

Lazy sequentialization is one of the most effective approaches for the bounded verification of
concurrent programs. Existing tools assume sequential consistency (SC), thus the feasibility …

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 …