论文信息 - The GP Programming System

The GP Programming System

We describe the programming system for the graph-transformation lan- guage GP, focusing on the implementation of its compiler and abstract machine. We also compare the system's performance with other graph-tra nsformation systems. The GP language is based on conditional rule schemata and comes with a simple formal semantics which maps input graphs to sets of output graphs. The imple- mentation faithfully matches the semantics by using backtracking and allowing to compute all possible results for a given input.

Detlef Plump | Greg Manning

[1] Daniel Grund,et al. GrGen: A Fast SPO-Based Graph Rewriting Tool , 2006, ICGT.

[2] Ulrich Nickel,et al. The FUJABA environment , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[3] Colin Runciman,et al. Specifying Pointer Structures by Graph Reduction , 2003, AGTIVE.

[4] Detlef Plump,et al. Towards Graph Programs for Graph Algorithms , 2004, ICGT.

[5] Detlef Plump,et al. The York Abstract Machine , 2008, GT-VMT@ETAPS.

[6] Annegret Habel,et al. Computational Completeness of Programming Languages Based on Graph Transformation , 2001, FoSSaCS.

[7] Gergely Varr ´ o,et al. Generic Search Plans for Matching Advanced Graph Patterns , 2007 .

[8] Albert Zündorf,et al. The PROGRES approach: language and environment , 1999 .

[9] Hassan Aït-Kaci. Warren's Abstract Machine , 1991, ICLP.

[10] Gabriele Taentzer,et al. The AGG approach: language and environment , 1999 .

[11] Ákos Horváth,et al. Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools , 2007, AGTIVE.

[12] Albert Zündorf,et al. Graph Pattern Matching in PROGRES , 1994, TAGT.

[13] Ákos Horváth,et al. Generic Search Plans for Matching Advanced Graph Patterns , 2007, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[14] Jeffrey Heer,et al. prefuse: a toolkit for interactive information visualization , 2005, CHI.