Case Study: Simulation of a LAN.

Electr. Notes Theor. Comput. Sci 01/2003; 72:71-73. DOI: 10.1016/S1571-0661(04)80627-3
Source: DBLP
Download full-text


Available from: Tom Mens, Oct 04, 2015
20 Reads
  • Source
    Electronic Notes in Theoretical Computer Science 03/2003; 72(4):1-5. DOI:10.1016/S1571-0661(04)80620-0
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising approach towards the problem of program erosion. Nevertheless a solid theoretical foundation is still lacking. In this paper we focus on improving the expressive power of graph rewriting rules, so that more refactorings can be expressed by single rules. Two new mechanisms are introduced: a notion of refinement of graphs, enabling one to treat specific substructures (e.g. syntax trees of expressions) as a whole, and a notion of duplication, enabling one to use parts of rewriting rules as prototypes that can be instantiated several times. Both mechanisms can be viewed as ways to specify large or infinite sets of rules in a concise way. It is shown that the refactorings PushdownMethod, ExtractMethod and InlineMethod can be expressed using the proposed techniques.
    Graph Transformations, Second International Conference, ICGT 2004, Rome, Italy, September 28 - October 2, 2004, Proceedings; 01/2004
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This article proposes a taxonomy of model transformation, based on the discussions of a working group on model transformation of the Dagstuhl seminar on Language Engineering for Model-Driven Software Development. This taxonomy can be used, among others, to help developers in deciding which model transformation language or tool is best suited to carry out a particular model transformation activity.
    Proceedings of the International Workshop on Graph and Model Transformation (GraMoT 2005); 03/2006
Show more