Sciweavers

113 search results - page 14 / 23
» An Example of Cloning Graph Transformation Rules for Program...
Sort
View
119
Voted
COORDINATION
2005
Springer
15 years 8 months ago
Synchronized Hyperedge Replacement for Heterogeneous Systems
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
Ivan Lanese, Emilio Tuosto
136
Voted
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 6 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
139
Voted
WOSP
2005
ACM
15 years 8 months ago
From UML to LQN by XML algebra-based model transformations
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Gordon Ping Gu, Dorina C. Petriu
119
Voted
SAC
2010
ACM
15 years 2 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
FOSSACS
2008
Springer
15 years 4 months ago
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisim...
Guilherme Rangel, Barbara König, Hartmut Ehri...