The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Foundations for the study of software architecture
ACM SIGSOFT Software Engineering Notes
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking, abstraction, and compositional verification
Model checking, abstraction, and compositional verification
Software engineering and middleware: a roadmap
Proceedings of the Conference on The Future of Software Engineering
High Level System Design and Analysis Using Abstract State Machines
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
XASM - An Extensible, Component-Based ASM Language
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
Evaluating and improving the automatic analysis of implicit invocation systems
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Compositional Verification of Middleware-Based Software Architecture Descriptions
Proceedings of the 26th International Conference on Software Engineering
Model checking publish-subscribe systems
SPIN'03 Proceedings of the 10th international conference on Model checking software
| Hi-index | 0.00 |
Behavioral analysis of middleware-based applications typically requires the analysis of the middleware and the application, in a monolithic way. In terms of model-checking, this is a complex task and may result in the well known “state-explosion” problem. These considerations led us to investigate a compositional verification approach which decomposes the system in accordance with its Software Architecture. The architectural decomposability theorem we defined in previous work decomposes the system into three logical layer: (i) application components, (ii) proxies and, (iii) middleware. This logical separation allows for reducing the global system validation to the verification of local behaviors. In this paper, we engineer the architectural decomposability theorem to the analysis of middleware-based applications by automatically generating the proxies needed by the components in order to properly interact with each other via the middleware. In particular, following the Model Driven Architecture approach and by making use of the Abstract State Machine formalism, we describe a set of transformation rules that allow for deriving correct proxies for using CORBA. By means of the proposed transformations, the correctness of the proxy behavioral models is guaranteed without the need to validate them with respect to the assumptions posed by the theorem.