Efficient computation of dominance in component systems (short paper)
Boender, Jaap (2011) Efficient computation of dominance in component systems (short paper). In: Software engineering and formal methods: 9th International Conference, SEFM 2011, Montevideo, Uruguay, November 14-18, 2011. Proceedings. Lecture Notes in Computer Science (7041). Springer, Berlin and Heidelberg, Germany, pp. 399-406. ISBN 9783642246890
Full text is not in this repository.
Official URL: http://dx.doi.org/10.1007/978-3-642-24690-6_27
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.
|Item Type:||Book Section|
Online ISBN: 9783642246906. Series ISSN: 0302-9743.
|Research Areas:||A. Middlesex University Schools and Centres > School of Science and Technology > Computer Science|
A. Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Foundations of Computing group
A. Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Artificial Intelligence group
|Deposited On:||06 Dec 2012 10:51|
|Last Modified:||04 Mar 2015 14:31|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year