We introduce a structure-aware parallel technique for context-bounded analysis of
concurrent programs. The key intuition consists in decomposing the set of concurrent traces …

Ranged program analysis has recently been proposed as a means to scale a single
analysis and to define parallel cooperation of different analyses. To this end, ranged …

Ranged symbolic execution has been proposed as a way of scaling symbolic execution by
splitting the task of path exploration onto several workers running in parallel. The split is …

Control-CPS software fault localization (SFL, aka bug localization) is of critical importance as
bugs may cause major failures, even injuries/deaths. To locate the bugs in control-CPSs …

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 technique for systematic testing of multi-threaded programs. We combine
Quasi-Optimal Partial-Order Reduction, a state-of-the-art technique that tackles path …

The goal of this work is to improve the efficiency of bounded model checkers that are
modular in the memory model. Our first contribution is a static analysis for the given memory …

Testing is a widely applied technique to evaluate software quality, and coverage criteria are
often used to assess the adequacy of a generated test suite. However, manually …

Program verification is one of the most important methods to ensuring the correctness of
concurrent programs. However, due to the path explosion problem, concurrent program …

Symbolic execution is a software verification technique symbolically running programs and
thereby checking for bugs. Ranged symbolic execution performs symbolic execution on …