Tool support for architecture analysis and design
ISAW '96 Joint proceedings of the second international software architecture workshop (ISAW-2) and international workshop on multiple perspectives in software development (Viewpoints '96) on SIGSOFT '96 workshops
Pattern-based design recovery of Java software
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
The perils of reconstructing architectures
ISAW '98 Proceedings of the third international workshop on Software architecture
On assessing the complexity of software architectures
ISAW '98 Proceedings of the third international workshop on Software architecture
Tracking degradation in software product lines through measurement of design rule violations
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
A Methodology for Architecture-Level Reliability Risk Analysis
IEEE Transactions on Software Engineering
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
Automated Software Engineering
Playing Detective: Reconstructing Software Architecture from Available Evidence
Automated Software Engineering
Performance-steered design of software architectures for embedded multicore systems
Software—Practice & Experience
A Graph Pattern Matching Approach to Software Architecture Recovery
ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Efficient Relational Calculation for Software Analysis
IEEE Transactions on Software Engineering
Relational programming with CrocoPat
Proceedings of the 28th international conference on Software engineering
Detecting Coordination Problems in Collaborative Software Development Environments
Information Systems Management
An architecture-centric software maintainability assessment using information theory
Journal of Software Maintenance and Evolution: Research and Practice
Hi-index | 0.00 |
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.