Computing dynamic clusters

Philippe Dugerdil, Sebastien Jossi
2009 Proceeding of the 2nd annual conference on India software engineering conference - ISEC '09  
When trying to reverse engineer software, execution trace analysis is increasingly used. Though, by using this technique we are quickly faced with an enormous amount of data that we must process. While many solutions have been proposed that consist of summarizing, filtering or compressing the trace, the lossless techniques are seldom able to cope with millions of events. Then, we developed a dynamic clustering technique, based on the segmentation of the execution trace that can losslessly
more » ... an losslessly process such a large quantity of data. In order to compute the clusters of classes we use a maximal clique computing algorithm. After having presented our technology we show experimental results highlighting that it is robust with respect to the segmentation parameters. Finally we present the tool we developed to compute dynamic clusters from execution traces.
doi:10.1145/1506216.1506228 dblp:conf/indiaSE/DugerdilJ09 fatcat:sxxieglerzbtro6qc3k5atg3im