[PDF] Top 20 Volume 32: Graph-Based Tools 2010

... The double pushout rewriting process necessitates an update of the transformation rules when the content of an initial graph is given. Using an imperative language, such an update is not difficult. However, the ... See full document

... given graph satisfies certain consistency conditions specified for a graph ...on graph grammars with a specific start graph, but on a control flow-based ordering of ...A graph ... See full document

... condition graph (condition over ...from graph Route (consisting of a single Route node) into the host graph must not exist for the rule to be ...Route graph, formulated as disjunction ... See full document

... and graph transformations. Thereby, a graph can also represent dynamic aspects of a model, like animations, and graph transformations are triggered over time to control the behavior, like starting, ... See full document

... generic graph visualization methods fail to emphasize the underlying logical structure of our model, we used domain-specific layouts by customizing generic graph layout algorithms with data from the ... See full document

... As an example throughout the paper we use a graph transformation system that models a single- linked list. The list is formed by cells, representing the elements in the list, which are connected by a next pointer. ... See full document

... Assistance based on hypergraph patches has been integrated into DiaGen editors as follows: The editor automatically maintains the hypergraph representation of the ... See full document

... We showed a successful way of parallellising graph-based state space generation, using a combi- nation of three tools: GROOVE , BLISS and LTS MIN . A nontrivial step is the encoding of arbitrary ... See full document

... We compared the rete-dfs exploration strategy, which uses RETE as an incremental matching algorithm, with DFS and BFS strategies, which use search plan for matching. We executed all of these strategies on four different ... See full document

... of graph transformation systems extended by the notion of ...timed graph transformation systems in order to be able to handle larger state spaces and to obtain a more efficient verification ... See full document

... start graph of the automata syntax grammar, the abstract syntax can be defined in the abstract syntax panel to the right ( 2 in Figure 4), where the abstract syntax of the automata alphabet is ... See full document

... of graph transformation systems. Therefore, tools supporting formal verification of graph transformations will increase the attractiveness of this modeling technique and are in this sense important ... See full document

... a graph transformation [EEKR99] based Java code analysis tool for the automatic check of Java applications for “standard errors” specific to a given exercise, so the manual correction later on can focus on ... See full document

... in label or end nodes are taken into account), and everywhere asymmetric in its third and fourth parameter (so that the direction of the edges is taken into account). In practice, however, we have to make do with the ... See full document

... the graph model, corresponding nodes are added to the instance ...instance graph if an arrow component is added to the graph ...instance graph that correspond to the two associations of the ... See full document

... our graph model, we consider only larger code parts, such as subroutines, signal entries, and variable declarations, and go into detail only when necessary, for example when dealing with statements sending ...the ... See full document

... various tools by allowing to generate suitable analysis and integration tools helping to understand and interpret [R¨ot04] the available data and keeping distributed data consistent across tool boundaries ... See full document

... a graph sequence include the highest single layout quality and the lowest difference between two successive ...of graph sequences without ruining the ...layouting graph transfor- mation ... See full document

... (Attributed Graph Grammar System) is a general purpose graph transformation tool used in high level Java ...a graph grammar approach rather than programmed graph ...input graph, and ... See full document

... The code generated requires some special functionality which has to be provided by the under- lying infrastructure. This functionality can be subsumed under the following four requirements: (1) The runtime state of each ... See full document