2011
DOI: 10.1007/978-3-642-19440-5_19
|View full text |Cite
|
Sign up to set email alerts
|

DSLTrans: A Turing Incomplete Transformation Language

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
4
2

Relationship

4
2

Authors

Journals

citations
Cited by 19 publications
(29 citation statements)
references
References 6 publications
0
28
0
Order By: Relevance
“…For example, DslTrans [9] uses layered transformation rules and an in-place style: rules within a layer are executed until they cannot match anymore, which occurs because models contain a finite amount of nodes that are deleted in the process, preventing recursions and forbidding loops syntactically.…”
Section: Expressiveness Reductionmentioning
confidence: 99%
See 2 more Smart Citations
“…For example, DslTrans [9] uses layered transformation rules and an in-place style: rules within a layer are executed until they cannot match anymore, which occurs because models contain a finite amount of nodes that are deleted in the process, preventing recursions and forbidding loops syntactically.…”
Section: Expressiveness Reductionmentioning
confidence: 99%
“…In DslTrans for example [9], the Tl controls non-determinism occuring within one layer by amalgamating the results before executing the next layer. This ensures confluence at each layer's execution, and thus for a transformation.…”
Section: Expressiveness Reductionmentioning
confidence: 99%
See 1 more Smart Citation
“…DSLTrans is an out-place, graph-based and rule-based model transformation engine that has two important properties enforced by construction: all its computations are both terminating and confluent [6]. Besides their obvious importance in practice, these two properties were instrumental in the implementation of a verification technique for pre-/ post-condition properties that can be shown to hold for all executions of a given DSLTrans model transformation, independently of the provided input model [21,22,30].…”
Section: Background: Dsltransmentioning
confidence: 99%
“…In an attempt to answer the above research question and overcome limitations of previous studies, we investigate verifying properties of transformations implemented in the graph-based model transformation language DSLTrans [7]. DSLTrans is non-Turing complete, i.e., DSLTrans cannot specify transformations that require unbounded loops (e.g., simulation transformations).…”
Section: Introductionmentioning
confidence: 99%