Sciweavers

1830 search results - page 42 / 366
» Workshop on Graph Computation Models
Sort
View
GG
2010
Springer
13 years 8 months ago
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
Stefan Jurack, Gabriele Taentzer
PC
2000
93views Management» more  PC 2000»
13 years 7 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
ICCS
2000
Springer
13 years 11 months ago
Extending the CG Model by Simulations
Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
Jean-François Baget
GG
2008
Springer
13 years 8 months ago
Adaptive Star Grammars for Graph Models
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
Frank Drewes, Berthold Hoffmann, Mark Minas
ERSHOV
2006
Springer
13 years 9 months ago
On the Usage of Concrete Syntax in Model Transformation Rules
Graph transformations are one of the best known approaches for defining transformations in model-based software development. They are defined over the abstract syntax of source and...
Thomas Baar, Jon Whittle