Foundations for the study of software architecture
ACM SIGSOFT Software Engineering Notes
A Syntactic Theory of Software Architecture
IEEE Transactions on Software Engineering - Special issue on software architecture
Correct Architecture Refinement
IEEE Transactions on Software Engineering - Special issue on software architecture
Formalizing style to understand descriptions of software architecture
ACM Transactions on Software Engineering and Methodology (TOSEM)
Software architecture: perspectives on an emerging discipline
Software architecture: perspectives on an emerging discipline
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
On the formalization of architectural types with process algebras
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Communication and Concurrency
Detecting Architectural Mismatches in Process Algebraic Descriptions of Software Systems
WICSA '01 Proceedings of the Working IEEE/IFIP Conference on Software Architecture
A Case Study in Architectural Modelling: The AEGIS System
IWSSD '96 Proceedings of the 8th International Workshop on Software Specification and Design
Architecting families of software systems with process algebras
ACM Transactions on Software Engineering and Methodology (TOSEM)
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
On the usability of process algebra: an architectural view
Theoretical Computer Science - Process algebra
| Hi-index | 0.00 |
The problem of formalizing architectural styles has been recently tackled with the introduction of the concept of architectural type. The internal behavior of the system components can vary from instance to instance of an architectural type in a controlled way, which preserves the absence of deadlock related architectural mismatches proved via the architectural compatibility and interoperability checks. In this paper we extend the notion of architectural type by permitting a controlled variability of the component topology as well. This is achieved by declaring some component connections to be extensible, in the sense that the number of connected components can vary from instance to instance of an architectural type. We show that such a controlled variability of the topology is still manageable from the analysis viewpoint, as the architectural compatibility and interoperability checks scale with respect to the number of components attached to the extensible connections.