Efficient Computation of Dominance in Component Systems (Short Paper)

  • Jaap Boender
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7041)


To deal with the complexity of modern systems, they are split up into components. These components use metadata to specify whether they need other components to function correctly (dependencies) or whether they cannot function with other components (conflicts).

In previous work, we have presented component relationships that are more useful for analysis than those specified in the metadata: strong dependencies that identify components that are absolutely necessary, and dominance that allows us to gain insight in the structure of a component system by identifying clusters of related packages.

In this paper, we present an efficient way of computing this dominance relationship, by exploiting its similarity to the concept of dominance already known in the field of control flow graphs.


Strong Dependency Maximal Clique Graph Transformation Software Product Line Control Flow Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abate, P., Di Cosmo, R., Boender, J., Zacchiroli, S.: Strong dependencies between software components. In: ESEM 2009: Proceedings of the 2009 3rd International Symposium on Empirical Software Engineering and Measurement, pp. 89–99. IEEE Computer Society, Washington, DC, USA (2009)Google Scholar
  2. 2.
    Crnkovic, I., Schmidt, H., Stafford, J., Wallnau, K.: Anatomy of a research project in predictable assembly. In: Proceedings of the 5th ICSE Workshop on Component-Based Software Engineering (2002), White paper Google Scholar
  3. 3.
    Di Cosmo, R., Zacchiroli, S.: Feature diagrams as package dependencies. In: Bosch, J., Lee, J. (eds.) SPLC 2010. LNCS, vol. 6287, pp. 476–480. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    LaBelle, N., Wallingford, E.: Inter-package dependency networks in open-source software. CoRR, cs.SE/0411096 (2004)Google Scholar
  5. 5.
    Le Berre, D., Rapicault, P.: Dependency management for the eclipse ecosystem: An update. In: 3rd International Workshop on Logic and Search (Lash 2010) (July 2010)Google Scholar
  6. 6.
    Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1(1), 121–141 (1979)CrossRefzbMATHGoogle Scholar
  7. 7.
    Maillart, T., Sornette, D., Spaeth, S., von Krogh, G.: Empirical Tests of Zipf’s Law Mechanism in Open Source Linux Distribution. Phys. Rev. Lett. 101(21), 218701 (2008)CrossRefGoogle Scholar
  8. 8.
    Schobbens, P.-Y., Heymans, P., Trigaux, J.-C.: Feature diagrams: A survey and a formal semantics. In: RE 2006, pp. 136–145. IEEE, Los Alamitos (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jaap Boender
    • 1
  1. 1.Univ Paris Diderot, Sorbonne Paris Cité, PPS, UMR 7126 CNRSParisFrance

Personalised recommendations