Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
Termination of graph rewriting is undecidable
Fundamenta Informaticae
Refactoring: improving the design of existing code
Refactoring: improving the design of existing code
High-level replacement systems applied to algebraic specifications and Petri nets
Handbook of graph grammars and computing by graph transformation
Proving termination with multiset orderings
Communications of the ACM
Graph rewrite systems for program optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
Formalising Behaviour Preserving Program Transformations
ICGT '02 Proceedings of the First International Conference on Graph Transformation
VL '00 Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00)
Defining and validating transformations of UML models
HCC '03 Proceedings of the 2003 IEEE Symposium on Human Centric Computing Languages and Environments
Consistency checking and visualization of OCL constraints
UML'00 Proceedings of the 3rd international conference on The unified modeling language: advancing the standard
Termination Criteria for DPO Transformations with Injective Matches
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidable Control Conditions in Graph Transformation Units
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositionality of Model Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining termination criteria by isolating deletion
ICGT'10 Proceedings of the 5th international conference on Graph transformations
A model for distribution and revocation of certificates
ICGT'10 Proceedings of the 5th international conference on Graph transformations
| Hi-index | 0.00 |
Visual rewriting techniques, in particular graph transformations, are increasingly used to model transformations of systems specified through diagrammatic sentences. Several rewriting models have been proposed, differing in the expressivity of the types of rules and in the complexity of the rewriting mechanism; yet basic results concerning the formal properties of these models are still missing for many of them. In this paper, we propose a contribution towards solving the termination problem for rewriting systems with external control mechanisms. In particular, we obtain results of more general validity by extending the concept of transformation unit to high-level replacement systems, a generalization of graph transformation systems. For high-level replacement units, we state and prove several abstract properties based on termination criteria. Then, we instantiate the high-level replacement systems by attributed graph transformation systems and present concrete termination criteria. These are used to show the termination of some replacement units needed to express model transformations as a consequence of software refactoring.