Sciweavers

96
Voted
GG
2008
Springer
15 years 1 months ago
Pattern-Based Model-to-Model Transformation
We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple ...
Juan de Lara, Esther Guerra
94
Voted
GG
2008
Springer
15 years 1 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
88
Voted
GG
2008
Springer
15 years 1 months ago
High-Level Programs and Program Conditions
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot descr...
Karl Azab, Annegret Habel
107
Voted
GG
2008
Springer
15 years 1 months ago
A Decentralized Implementation of Mobile Ambients
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
Fabio Gadducci, Giacoma Valentina Monreale
124
Voted
GG
2008
Springer
15 years 1 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
66
Voted
GG
2008
Springer
15 years 1 months ago
Abstract Semantics by Observable Contexts
Filippo Bonchi
91
Voted
GG
2008
Springer
15 years 1 months ago
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
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...
Hartmut Ehrig, Ulrike Prange
77
Voted
GG
2008
Springer
15 years 1 months ago
On the Recognizability of Arrow and Graph Languages
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
Harrie Jan Sander Bruggink, Barbara König