Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems

Jannik Laval (1) , Jean-Rémy Falleri (1) , Philippe Vismara (2) , Stéphane Ducasse (3)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 COCONUT - Agents, Apprentissage, Contraintes
3 RMOD - Analyses and Languages Constructs for Object-Oriented Application Evolution

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 developers to remove cycles from their programs. In this paper, we describe an efficient algorithm that performs a fine-grained analysis of cycles among application packages. In addition, we define multiple metrics to rank cycles by their level of undesirability, prioritizing cycles that are the more undesired by developers. We compare these multiple ranking metrics on four large and mature software systems in Java and Smalltalk.

Mots clés: Software architecture; software re-engineering; package cycle; package dependency

Domaines: Langage de programmation [cs.PL]

Jannik Laval, Jean-Rémy Falleri, Philippe Vismara, Stéphane Ducasse. Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems. The Journal of Object Technology, 2012, 11 (1), pp.N/A. ⟨10.5381/jot.2012.11.1.a4⟩. ⟨hal-00692569⟩