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
2 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
3 RMOD - Analyses and Languages Constructs for Object-Oriented Application Evolution
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
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 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-00692569
Contributor : Lse Lse <>
Submitted on : Monday, April 30, 2012 - 11:13:20 PM
Last modification on : Thursday, February 21, 2019 - 10:52:50 AM
Document(s) archivé(s) le : Thursday, December 15, 2016 - 3:33:50 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

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, Chair of Software Engineering, 2012, 11 (1), pp.N/A. ⟨10.5381/jot.2012.11.1.a4⟩. ⟨hal-00692569⟩

Share

Metrics

Record views

598

Files downloads

283