Static information-flow analysis (especially taint-analysis) is a key technique in software
security, computing where sensitive or untrusted data can propagate in a program. Points-to …

Multithreaded programs are hard to get right. A key reason is that the contract between
developers and runtimes grants exponentially many schedules to the runtimes. We present …

Just as errors in sequential programs can lead to security exploits, errors in concurrent
programs can lead to concurrency attacks. Questions such as whether these attacks are …

Concurrent programs are still prone to bugs arising from the subtle interleavings of threads.
Traditional static analysis for concurrent programs, such as data-flow analysis and symbolic …

Kernel concurrency bugs are notoriously difficult to find during testing since they are only
triggered under certain instruction interleavings. Unfortunately, no tools for systematically …

Bounded model checking is among the most efficient techniques for the automated
verification of concurrent programs. However, due to the nondeterministic thread …

Dynamic analysis techniques have been proposed to detect potential deadlocks. Analyzing
and comprehending each potential deadlock to determine whether the deadlock is feasible …

Making parallel programs reliable with stable multithreading Page 1 58 communications of the
acm | march 2014 | vol. 57 | no. 3 contributed articles ill us tra tion b y Joel o rmsb y reliaBle …

We propose a new method for runtime prevention of type state violations in multithreaded
applications due to erroneous thread interleavings. The new method employs a combination …

We propose constraining multithreaded execution to small sets of input-covering schedules,
which we define as follows: given a program P, we say that a set of schedules∑ covers all …