We present a novel dynamic analysis technique that finds real deadlocks in multi-threaded
programs. Our technique runs in two stages. In the first stage, we use an imprecise dynamic …

We present an effective static deadlock detection algorithm for Java. Our algorithm uses a
novel combination of static analyses each of which approximates a different necessary …

Library writers wish to provide a guarantee not only that each procedure in the library
performs correctly in isolation, but also that the procedures perform correctly when run in …

We propose a new approach for dynamic software updates. This approach allows updating
applications that until now could not be updated at runtime at all or could be updated but …

We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy
and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of a …

We present an effective dynamic analysis for finding a broad class of deadlocks, including
the well-studied lock-only deadlocks as well as the less-studied, but no less widespread or …

We present a new technique to find real deadlocks in concurrent programs that use locks.
For 4.5 million lines of Java, our technique found almost twice as many real deadlocks as …

Concurrent programs are notorious for containing errors that are difficult to reproduce and
diagnose. A common kind of concurrency error is deadlock, which occurs when a set of …

Concurrent programs are notorious for containing errors that are difficult to reproduce and
diagnose. A common kind of concurrency error is deadlock, which occurs when some …

We present a static deadlock analysis approach for C/pthreads. The design of our method
has been guided by the requirement to analyse real-world code. Our approach is sound (ie …