Compositional Verification of Architectural Refactorings

Authors:
Dénes Bisztray;Reiko Heckel;Hartmut Ehrig
Affiliations:
Department of Computer Science, University of Leicester,;Department of Computer Science, University of Leicester,;Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin,
Venue:
Architecting Dependable Systems VI
Year:
2009

Citing 0
Cited 5

A hoare calculus for graph programs

ICGT'10 Proceedings of the 5th international conference on Graph transformations
Iterative development of consistency-preserving rule-based refactorings

ICMT'11 Proceedings of the 4th international conference on Theory and practice of model transformations
Hoare-Style Verification of Graph Programs

Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Towards automatic verification of behavior preservation for model transformation via invariant checking

ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Verification of graph programs

ICGT'12 Proceedings of the 6th international conference on Graph Transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

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