Hi all,
I will be giving a practice talk for ISSTA'07 tomorrow (5/25) at 4:00 pm
in 3310 CS. Here is the abstract:
Statistical Debugging Using Compound Boolean Predicates
Statistical debugging uses dynamic instrumentation and machine learning
to identify predicates on program state that are strongly predictive of
program failure. Prior approaches have only considered simple, atomic
predicates such as the directions of branches or the return values of
function calls. We enrich the predicate vocabulary by adding complex
Boolean formulae derived from these simple predicates. We draw upon
three-valued logic, static program structure, and statistical estimation
techniques to efficiently sift through large numbers of candidate
Boolean predicate formulae. We present qualitative and quantitative
evidence that complex predicates are practical, precise, and
informative. Furthermore, we demonstrate that our approach is robust in
the face of incomplete data provided by the sparse random sampling that
typifies post-deployment statistical debugging.
Please come if you can.
Thanks,
-Arumuga
|