Sciweavers

Share
KDD
2010
ACM

Mining program workflow from interleaved traces

9 years 2 months ago
Mining program workflow from interleaved traces
Successful software maintenance is becoming increasingly critical due to the increasing dependence of our society and economy on software systems. One key problem of software maintenance is the difficulty in understanding the evolving software systems. Program workflows can help system operators and administrators to understand system behaviors and verify system executions so as to greatly facilitate system maintenance. In this paper, we propose an algorithm to automatically discover program workflows from event traces that record system events during system execution. Different from existing workflow mining algorithms, our approach can construct concurrent workflows from traces of interleaved events. Our workflow mining approach is a three-step coarse-to-fine algorithm. At first, we mine temporal dependencies for each pair of events. Then, based on the mined pair-wise temporal dependencies, we construct a basic workflow model by a breadth-first path pruning algorithm. After that, we ...
Jian-Guang Lou, Qiang Fu, Shengqi Yang, Jiang Li,
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where KDD
Authors Jian-Guang Lou, Qiang Fu, Shengqi Yang, Jiang Li, Bin Wu
Comments (0)
books