Sciweavers

Share
INDIASE
2009
ACM

Computing dynamic clusters

11 years 8 months ago
Computing dynamic clusters
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 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. Categories and Subject Descriptors D.2.7 [Software Engineering]: Distribution, Maintenance, and Enhancement - Restructuring, reverse engineeri...
Philippe Dugerdil, Sebastien Jossi
Added 28 May 2010
Updated 28 May 2010
Type Conference
Year 2009
Where INDIASE
Authors Philippe Dugerdil, Sebastien Jossi
Comments (0)
books