Sciweavers

6 search results - page 1 / 2
» Correctness, Completeness and Termination of Pattern-Based M...
Sort
View
CALCO
2009
Springer
169views Mathematics» more  CALCO 2009»
13 years 11 months ago
Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation
Abstract. Model-to-model (M2M) transformation consists in transforming models from a source to a target language. Many transformation languages exist, but few of them combine a dec...
Fernando Orejas, Esther Guerra, Juan de Lara, Hart...
MODELS
2009
Springer
13 years 9 months ago
On-the-Fly Construction, Correctness and Completeness of Model Transformations Based on Triple Graph Grammars
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...
Hartmut Ehrig, Claudia Ermel, Frank Hermann, Ulrik...
MFCS
1997
Springer
13 years 8 months ago
Simulation as a Correct Transformation of Rewrite Systems
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
Wan Fokkink, Jaco van de Pol
GG
2010
Springer
13 years 2 months ago
Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
Frank Hermann, Hartmut Ehrig, Fernando Orejas, Ulr...
ENTCS
2008
97views more  ENTCS 2008»
13 years 4 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann