Application of Graph Transformation to Visual Languages

Bardohl, Roswitha; Minas, Mark; Taentzer, Gabriele; Schürr, Andy

doi:10.1142/9789812815149_0003

Cited by 75 publications

(25 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Graph transformation has been used, for example, as an efficient computational model for term rewriting systems and functional programming languages [5,34] and for specifying visual languages and generating associated editors [4,31]. Besides specific applications of graph transformation, several programming languages have been developed that are based on graph transformation rules.…”

Section: Introductionmentioning

confidence: 99%

Hierarchical Graph Transformation

Drewes

Hoffmann

Plump

2002

Journal of Computer and System Sciences

View full text Add to dashboard Cite

When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the well-known double-pushout approach from flat to hierarchical graphs. In particular, we show how pushouts and pushout complements of hierarchical graphs and graph morphisms can be constructed recursively. Moreover, we make rules more expressive by introducing variables which allow us to copy and remove hierarchical subgraphs in a single rule application. © 2002 Elsevier Science (USA)

show abstract

Section: Introductionmentioning

confidence: 99%

Hierarchical Graph Transformation

Drewes

Hoffmann

Plump

2002

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…So, the use of graph grammars has often been considered a natural choice for their specification. Moreover, graph grammar principles have been widely adopted as a basis for the generation of visual environments [7][8][9]. Close to grammar-based approaches, are the formal specification methods based on rewriting systems [10].…”

Section: Introductionmentioning

confidence: 99%

VALUTA: A Tool to Specify and Verify Interactive Visual Applications

Cassino

Tucci

2010

Management of the Interconnected World

View full text Add to dashboard Cite

This paper presents a system to specify and verify web applications, based on previous results on usability evaluation of interactive visual interfaces by means of checking their corresponding formal specification. In Cassino and Tucci we have described a methodology to design, specify and evaluate interactive visual interfaces, based on the SR-Action Grammars formalism, and we have presented a bottom – up approach to guide the designer to develop graphical user interface which respect any usability metrics before the software is released and tested by standard methods. TAGIVE (Tool for the Aided Generation of Interactive Visual Environments) is a visual environment for the implementation of interactive visual applications (html, xml, java applications), and for the generation of the underlying SR-Action Grammar specification. Now, we present VALUTA (Automatic Tool for the Usability V erification at A bstraction Level ), a tool that supports the generation of the formal specification of existing interactive visual applications in an automatic manner, so to perform the related usability controls. Checking the usability of interactive applications at a formal level, allows a designer to perform feedback analysis of the environment under consideration

show abstract

“…Languages really differ in the strength of pattern definition mechanisms and control structures governing the execution order of rules [8]. It should be mentioned that an early pioneer in the area (well before the MDA era) is the PROGRES language [9]. This semi-graphical language offered pattern-based graph rewrite rules applicable to "models" described by schemas (actually, metamodels).…”

Section: Introductionmentioning

confidence: 99%