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

Jean-Rémy Falleri 1 Simon Denier 2 Jannik Laval 2 Philippe Vismara 3 Stéphane Ducasse 2
2 RMOD - Analyses and Languages Constructs for Object-Oriented Application Evolution
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
3 MAREL - Models And Reuse Engineering, Languages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Document type :
Conference papers
Liste complète des métadonnées

Contributor : Lse Lse <>
Submitted on : Friday, October 28, 2011 - 11:53:32 AM
Last modification on : Thursday, February 21, 2019 - 10:52:50 AM
Document(s) archivé(s) le : Sunday, December 4, 2016 - 4:19:45 PM


Files produced by the author(s)



Jean-Rémy Falleri, Simon Denier, Jannik Laval, Philippe Vismara, Stéphane Ducasse. Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems. International Conference on Objects, Models, Components, Patterns (TOOLS), Jun 2011, Zurich, Switzerland. pp.260-275, ⟨10.1007/978-3-642-21952-8_19⟩. ⟨inria-00614770⟩



Record views


Files downloads