Empirical investigation of SEA-based dependence cluster properties
| Autor: | Lajos Schrettner, Béla Csaba, Tibor Gyimóthy, Arpad Beszedes, Judit Jász, Tamás Gergely |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Structure (mathematical logic)
Theoretical computer science Source code Computer science Heuristic media_common.quotation_subject 020207 software engineering 02 engineering and technology Change impact analysis Dependence relation Set (abstract data type) Identification (information) 0202 electrical engineering electronic engineering information engineering Cluster (physics) 020201 artificial intelligence & image processing Software media_common |
| Zdroj: | SCAM |
| ISSN: | 0167-6423 |
| DOI: | 10.1016/j.scico.2014.09.010 |
| Popis: | Dependence clusters are (maximal) groups of source code entities that each depend on the other according to some dependence relation. Such clusters are generally seen as detrimental to many software engineering activities, but their formation and overall structure are not well understood yet. In a set of subject programs from moderate to large sizes, we observed frequent occurrence of dependence clusters using Static Execute After (SEA) dependences (SEA is a conservative yet efficiently computable dependence relation on program procedures). We identified potential linchpins inside the clusters; these are procedures that can primarily be made responsible for keeping the cluster together. Furthermore, we found that as the size of the system increases, it is more likely that multiple procedures are jointly responsible as sets of linchpins. We also give a heuristic method based on structural metrics for locating possible linchpins as their exact identification is unfeasible in practice, and presently there are no better ways than the brute-force method. We defined novel metrics and comparison methods to be able to demonstrate clusters of different sizes in programs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect