[PDF] Top 20 Volume 30: Graph and Model Transformation 2010

... by graph transformation in a rule-based ...as model driven engineering and model-integrated computing, there is an emerging need to describe model manipulations, model evolution, ... See full document

... Additionally, the language engineer will describe the expected behavior of that model in a precise, semi-formal way (more on that in the next section). Finally, executable test cases are generated from the example ... See full document

... with model transformations in the context of graph ...of model transformation definitions. Model transformations based on graph ...define model transformations is by ... See full document

... of model driven architecture (MDA), a system is implemented by first speci- fying an abstract model, which is subsequently refined to executable ...by model transformations, which transform a source ... See full document

... into graph transformation systems, resides in the identification of an intermediate algebra of designs, which bridges the gap between the syntax of the process calculus and the set theoretical definition of ... See full document

... Abstract: Termination of graph transformations is in general undecidable, but it is possible to prove it for specific systems by checking for sufficient conditions. In the presence of rules with negative ... See full document

... from model-to-text transforma- ...While model-to-model transformation approaches such as QVT [QVT], ATL [EMP] and graph transformation-based approaches [SNZ08] like Atom3 [LV02], ... See full document

... especially graph transformations, have provided precise se- mantics for model specifications and transformation concepts from abstract to concrete system descriptions including correctness notions ... See full document

... asks for the concepts and models underlying its design. The distinction between the last two questions, however, is not exclusive, since also models are tools, and tools, like formalisms and languages, are ... See full document

... and transformation systems had been developed in the past mainly from the language and the process specification point of view [Roz97], but data types had to be handled separately by algebraic specification ... See full document

... CSP model from the LLVM compiler intermediate representation ...low-level model refines a high-level model which is also given in a CSP-based ...CSP model is closed by an investigation of the ... See full document

... type graph, constraints may be used to specify conditions on graphs (and rules) within the ...type graph utilises inheritance to create an R supertype for all carbon/hydrocarbon node ... See full document

... Graph conditions are a well-known concept for describing graph properties in a graphical way by graphs and graph morphisms (see e.g. [EH86, HHT96, HW95, KMP05, EEHP06, HP09]). In the following, we ... See full document

... Abstract: Graph grammars may be used as specification technique for different kinds of systems, specially in situations in which states are complex structures that can be adequately modeled as graphs (possibly ... See full document

... We have presented second-order value numbering, a new optimization technique for suppress- ing redundancy, in a version tailored to the application for improving the decision procedure o[r] ... See full document

... of graph models and calls for rigorous methods to capture the semantics of graph models and their evolution over time ...behind graph models have been captured long ago by mathematical terms, thus ... See full document

... of graph transformation rules in our context is based on defining a graph transformation rule as an E-graph transformation rule, together with a set of formulas that glob- ally ... See full document

... The carrier sets in the Skype−Σ algebra A for the sorts ComRequest and Log consist only of the terms over the given constructor operations. Note that this algebra is used for concrete Skype nets only and we describe ... See full document

... Proof. Each y ∈ prd A (x,n) product-influences x in at most n steps. By the definition of influence graph, for each entity y that product-influences x in k-step (for some k), there is a path of length k from y to ... See full document

... to model stochastically a “smart” reconfiguration strategy, one could make the probability of application inversely dependant on the difference between quota and area consumption (a derived attribute associated ... See full document