The first installment of the
“big bad” series described how a compiler can optimize your concurrent
program into oblivion, while the second installment introduced
a tool to analyze small litmus tests for such problems. Those two
articles can be especially helpful for training, design
discussions, and checking small samples of code. Although such
automated training and design tools are welcome, automated code
inspection that could locate even one class of concurrency bugs would be
even better. In this two-part article, we look at a tool to do that kind
of analysis.

Source: LWN.net – [$] Concurrency bugs should fear the big bad data-race detector (part 1)