ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Visual Languages & Computing
Volume 16, Issue 6, December 2005, Pages 485-507
Selected papers from Visual Languages and Formal Methods 2004 (VLFM '04)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (340 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.jvlc.2005.07.001    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier Ltd All rights reserved.

High-level replacement units and their termination propertiesstar, open

Paolo Bottonia, Corresponding Author Contact Information, E-mail The Corresponding Author, Kathrin Hoffmanna, b, Francesco Parisi Presiccea, c and Gabriele Taentzerb

aUniversity of Rome La Sapienza, Italy bTechnical University, Berlin, Germany cGeorge Mason University, USA

Received 4 July 2005; 
accepted 5 July 2005. 
Available online 19 September 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

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, for many of them, basic results concerning the formal properties of these models are still missing. In this paper, we give 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. We explore some types of rules and replacement units for which the criterion can be established. These are used to show the termination of some replacement units needed to express model transformations formalizing refactoring.

Keywords: Visual transformations; Transformation units; High level replacement; Termination; Refactoring

Article Outline

1. Introduction
1.1. Paper organization
2. Related work
3. An algebraic setting for termination
3.1. High-level replacement units
3.2. Instantiation by attributed graph transformation
4. Examples from model refactoring
5. Termination of replacement units
5.1. A general termination criterion for high-level replacement units
6. Special termination criteria for sequential compositions
7. Concrete termination criteria for attributed graph transformation
8. Discussion of further termination criteria
8.1. Contextual layered graph grammars
8.2. Negative applicative conditions
9. Conclusions
Acknowledgements
References















Journal of Visual Languages & Computing
Volume 16, Issue 6, December 2005, Pages 485-507
Selected papers from Visual Languages and Formal Methods 2004 (VLFM '04)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.