R. Kazman, and M. Burth. CSMR '98: Proceedings of the 2nd Euromicro Conference on Software Maintenance and Reengineering ( CSMR'98), page 104. Washington, DC, USA, IEEE Computer Society, (1998)
Abstract
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our approach to measuring complexity is based on observation that large systems with a regular substructure are simple to create and maintain, whereas even relatively small systems created in an ad hoc fashion quickly become unmaintainable. This paper describes a system, called IAPR, that aids in architectural exploration and measurement by attempting to match patterns to an architecture. To do this, IAPR implements a heuristic form of sub-graph isomorphisman NP-hard problemusing the Constraint Satisfaction paradigm to limit the complexity of the problem space.
Description
Defines architecture complexity as a combination of the number of patterns needed to cover an architecture and the proportion of the architecture covered by some patterns.
%0 Conference Paper
%1 795017
%A Kazman, R.
%A Burth, M.
%B CSMR '98: Proceedings of the 2nd Euromicro Conference on Software Maintenance and Reengineering ( CSMR'98)
%C Washington, DC, USA
%D 1998
%I IEEE Computer Society
%K architecture complexity software
%P 104
%T Assessing Architectural Complexity
%X While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our approach to measuring complexity is based on observation that large systems with a regular substructure are simple to create and maintain, whereas even relatively small systems created in an ad hoc fashion quickly become unmaintainable. This paper describes a system, called IAPR, that aids in architectural exploration and measurement by attempting to match patterns to an architecture. To do this, IAPR implements a heuristic form of sub-graph isomorphisman NP-hard problemusing the Constraint Satisfaction paradigm to limit the complexity of the problem space.
%@ 0-8186-8421-6
@inproceedings{795017,
abstract = {While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our approach to measuring complexity is based on observation that large systems with a regular substructure are simple to create and maintain, whereas even relatively small systems created in an ad hoc fashion quickly become unmaintainable. This paper describes a system, called IAPR, that aids in architectural exploration and measurement by attempting to match patterns to an architecture. To do this, IAPR implements a heuristic form of sub-graph isomorphisman NP-hard problemusing the Constraint Satisfaction paradigm to limit the complexity of the problem space. },
added-at = {2010-01-24T13:39:10.000+0100},
address = {Washington, DC, USA},
author = {Kazman, R. and Burth, M.},
biburl = {https://www.bibsonomy.org/bibtex/2d7b70e716aff6fecd51f235e689d842f/ericbouwers},
booktitle = {CSMR '98: Proceedings of the 2nd Euromicro Conference on Software Maintenance and Reengineering ( CSMR'98)},
description = {Defines architecture complexity as a combination of the number of patterns needed to cover an architecture and the proportion of the architecture covered by some patterns.},
interhash = {2561cc7c03de977fb13c90daac86c46f},
intrahash = {d7b70e716aff6fecd51f235e689d842f},
isbn = {0-8186-8421-6},
keywords = {architecture complexity software},
pages = 104,
publisher = {IEEE Computer Society},
timestamp = {2010-01-24T13:39:10.000+0100},
title = {Assessing Architectural Complexity},
year = 1998
}