Name
Title | ||
|---|---|---|
Efficient retrieval and ranking of undesired package cycles in large software systems |
Abstract | ||
|---|---|---|
Many design guidelines state that a software system architecture should avoid cycles between its packages. Yet such cycles appear again and again in many programs. We believe that the existing approaches for cycle detection are too coarse to assist the developers to remove cycles from their programs. In this paper, we describe an efficient algorithm that performs a fine-grained analysis of the cycles among the packages of an application. In addition, we define a metric to rank cycles by their level of undesirability, prioritizing the cycles that seems the more undesired by the developers. Our approach is validated on two large and mature software systems in Java and Smalltalk. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-21952-8_19 | TOOLS (49) |
Keywords | Field | DocType |
cycle detection,fine-grained analysis,software system architecture,undesired package cycle,existing approach,large software system,efficient algorithm,mature software system,efficient retrieval,design guidelines state | Architecture,Software engineering,Ranking,Computer science,Smalltalk,Cycle detection,Software system,Theoretical computer science,Software architecture,Java,Dependency graph | Conference |
Volume | ISSN | Citations |
6705 | 0302-9743 | 13 |
PageRank | References | Authors |
0.69 | 18 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Rémy Falleri | 1 | 302 | 20.65 |
| Simon Denier | 2 | 67 | 6.93 |
| Jannik Laval | 3 | 116 | 13.63 |
| Philippe Vismara | 4 | 55 | 6.89 |
| Stéphane Ducasse | 5 | 3418 | 243.15 |