|
iDEA: Drexel E-repository and Archives >
Drexel Academic Community >
College of Engineering >
Department of Computer Science >
Faculty Research and Publications (Comp Sci) >
On computing the canonical features of software systems
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1860/2569
|
| Title: | On computing the canonical features of software systems |
| Authors: | Kothari, Jay
Denton, Trip
Mancoridis, Spiros
Shokoufandeh, Ali |
| Issue Date: | 23-Oct-2006 |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
| Citation: | Paper presented at the 13th Working Conference on Reverse Engineering, WCRE 2006, Benevento, Italy. |
| Abstract: | 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. |
| URI: | http://dx.doi.org/10.1109/WCRE.2006.39
http://hdl.handle.net/1860/2569 |
| Appears in Collections: | Faculty Research and Publications (Comp Sci)
|
Items in iDEA are protected by copyright, with all rights reserved, unless otherwise indicated.
|
www.drexel.edu
