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 …

Abstract Rapid advancements in Software Verification and Validation have been critical in
the wide development of tools and techniques to identify potential Concurrent bugs and …

We propose an under-approximate reachability analysis algorithm for programs running
under the POWER memory model, in the spirit of the work on context-bounded analysis …

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

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 …

We address the problem of verifying safety properties of concurrent programs running over
the Total Store Order (TSO) memory model. Known decision procedures for this model are …

We address the problem of verifying safety properties of concurrent programs running over
the TSO memory model. Known decision procedures for this model are based on complex …

Concurrent program verification is challenging due to a large number of thread
interferences. A popular approach is to encode concurrent programs as SMT formulas and …

Concurrency poses a major challenge for program verification, but it can also offer an
opportunity to scale when subproblems can be analysed in parallel. We exploit this …

Lazy sequentialization has emerged as one of the most promising approaches for
concurrent program analysis but the only efficient implementation given so far works just for …