With the success of model-driven development as well as component-based and\ud service-oriented systems, models of software architecture are key artifacts in the development\ud process. To adapt to changing requirements and improve internal software\ud quality such models have to evolve while preserving aspects of their behaviour. These\ud behaviour preserving developments are known as refactorings.\ud The verification of behaviour preservation requires formal semantics, which can\ud be defined by model transformation, e.g., using process algebras as semantic domain\ud for architectural models. Denotational semantics of programming languages are by\ud definition compositional. In order to enjoy a similar property in the case of model\ud transformations, every component of the source model should be distinguishable in the\ud target model and the mapping compatible with syntactic and semantic composition.\ud To avoid the costly verification of refactoring steps on large systems and create\ud refactoring patterns we present a general method based on compositional typed graph\ud transformations. This method allows us to extract a (usually much smaller) rule\ud from the transformation performed, verify this rule instead and use it as a refactoring\ud pattern in other scenarios.\ud The main result of the thesis shows that the verification of rules is indeed sufficient\ud to guarantee the desired semantic relation between source and target models. A formal\ud definition of compositionality for mappings from software models represented as\ud typed graphs to semantic domains is proposed. In order to guarantee compositionality,\ud a syntactic criterion has been established for the implementation of the mappings\ud by typed graph transformations with negative application conditions. We apply the\ud approach to the refactoring of architectural models based on UML component, structure,\ud and activity diagrams with CSP as semantic domain
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.