loading...
On Computing the Canonical Features of Software Systems
Benevento, Italy October 23-October 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WCRE.2006.3913th Working Conference on Reverse En ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jay Kothari, Drexel University, USA
Trip Denton, Drexel University, USA
Spiros Mancoridis, Drexel University, USA
Ali Shokoufandeh, Drexel University, USA
Software applications typically have many features that vary in their similarity. We define a measurement of similarity between pairs of features based on their underlying implementations and use this measurement to compute a set of canonical features. The Canonical Features Set (CFS) consists of a small number of features that are as dissimilar as possible to each other, yet are most representative of the features that are not in the CFS. The members of the CFS are distinguishing features and understanding their implementation provides the engineer with an overview of the system undergoing scrutiny. The members of the CFS can also be used as cluster centroids to partition the entire set of features. Partitioning the set of features can simplify the understanding of large and complex software systems. Additionally, when a specific feature must undergo maintenance, it is helpful to know which features are most closely related to it. We demonstrate the utility of our method through the analysis of the Jext, Firefox, and Gaim software systems.
Citation:
Jay Kothari, Trip Denton, Spiros Mancoridis, Ali Shokoufandeh, "On Computing the Canonical Features of Software Systems," wcre, pp.93-102, 13th Working Conference on Reverse Engineering (WCRE 2006), 2006
Usage of this product signifies your acceptance of the Terms of Use.