The design of concurrent programs is error-prone due to the interaction between
concurrently executing threads. Traditional automated techniques for finding errors in …

Dataflow analyses for concurrent programs differ from their single-threaded counterparts in
that they must account for shared memory locations being overwritten by concurrent threads …

Ensuring the correctness of multithreaded programs is difficult, due to the potential for
unexpected interactions between concurrent threads. Much previous work has focused on …

Atomicity is an important correctness condition for concurrent systems. Informally, atomicity
is the property that every concurrent execution of a set of transactions is equivalent to some …

Data race detection is highly essential for debugging multithreaded programs and assuring
their correctness. Nevertheless, there is no single universal technique capable of handling …

Writing and debugging concurrent (shared-variable) programs is notoriously difficult. This
motivated the development of numerous static analysis and run-time analysis techniques …

A large number of industrial concurrent programs are being designed based on a model
which combines threads with event-based communication. These programs consist of …

Atomicity is a fundamental correctness property in multithreaded programs, both because
atomic code blocks are amenable to sequential reasoning (which significantly simplifies …

Writing concurrent programs is highly error-prone due to the nondeterminism in interprocess
communication. The most reliable indicators of errors in concurrency are data races, which …

Software model checking has been successful for sequential programs, where predicate
abstraction offers suitable models, and counterexample-guided abstraction refinement …