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 …

Runtime verification is aimed at analyzing execution traces stemming from a running
program or system. The traditional purpose is to detect the lack of conformance with respect …

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 …

This tutorial deals with runtime enforcement and advocates its use as an extension of
runtime verification. While research efforts in runtime verification have been mainly …

While current bug detection techniques for concurrent software focus on unearthing low-
level issues such as data races or deadlocks, they often fall short of discovering more …

For a concurrent program, a prediction tool maps the history of a single run to a prediction of
bugs in an exponential number of other runs. If all those bugs can occur, then the tool is …

Programming errors occur frequently in large software systems, and even more so if these
systems are concurrent. In the past researchers have developed specialized programs to aid …

Researchers have proposed various approaches to detect concurrency bugs and improve
multi-threaded programs, but performing evaluations of the effectiveness of these …

Deadlocks in OS kernels can cause critical problems like performance degradation and
system hangs. However, detecting deadlocks in OS kernels is quite challenging, due to high …

Deadlocks are notorious bugs in multithreaded programs, causing serious reliability issues.
However, they are difficult to be fully expunged before deployment, as their appearances …