Efficient Computation of Dominance in Component Systems (Short Paper)

  • Jaap Boender
Conference paper

DOI: 10.1007/978-3-642-24690-6_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7041)
Cite this paper as:
Boender J. (2011) Efficient Computation of Dominance in Component Systems (Short Paper). In: Barthe G., Pardo A., Schneider G. (eds) Software Engineering and Formal Methods. SEFM 2011. Lecture Notes in Computer Science, vol 7041. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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