Debugging is notoriously difficult and extremely time consuming. Researchers have
therefore invested a considerable amount of effort in develo** automated techniques and …

Fault localization methods seek to identify faulty program statements based on the
information provided by the failing and passing test executions. Spectrum‐based methods …

Despite the capability in successfully fixing more and more real-world bugs, existing
Automated Program Repair (APR) techniques are still challenged by the long-standing …

Continuous processing of a streaming graph maintains an approximate result of the iterative
computation on a recent version of the graph. Upon a user query, the accurate result on the …

Typically debugging begins when during a program execution a point is reached at which
an obviously incorrect value is observed. A general and powerful approach to automated …

Program slicing systematically identifies parts of a program relevant to a seed statement.
Unfortunately, slices of modern programs often grow too large for human consumption. We …

Software misconfigurations are time-consuming and enormously frustrating to troubleshoot.
In this paper, we show that dynamic information flow analysis helps solve these problems by …

Software crash is common. When a crash occurs, software developers can receive a report
upon user permission. A crash report typically includes a call stack at the time of crash. An …

This paper presents an innovative model of a program's internal behavior over a set of test
inputs, called the probabilistic program dependence graph (PPDG), that facilitates …

We present a value profile based approach for ranking program statements according to
their likelihood of being faulty. The key idea is to see which program statements exercised …