103 search results - page 4 / 21 » Termination Criteria for Model Transformation |
PARLE
1991
13 years 9 months ago
1991
It is shown that the terminationdetection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the te...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
ENTCS
2006
2006
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
13 years 5 months ago
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic conce...
GG
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The correspond...
FROCOS
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...