Abstract
Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen, a generative programming system for graph rewriting, which applies heuristic optimizations. According to Varró’s benchmark it is at least one order of magnitude faster than any other tool known to us.
Our graph rewriting tool implements the well-founded single-pushout approach. We define the notion of search plans to represent different matching strategies and equip these search plans with a cost model, taking the present host graph into account. The task of selecting a good search plan is then viewed as an optimization problem.
For the ease of use, GrGen features an expressive specification language and generates program code with a convenient interface.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Geiß, R.: GRGEN (2006), http://www.info.uni-karlsruhe.de/software.php/id=7
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York (1990)
Schürr, A.: The PROGRESS Approach: Language and Environment. In: [24], vol. 2, pp. 487–550 (1999)
Ermel, C., Rudolf, M., Taentzer, G.: The AGG Approach: Language and Environment. In: [24], vol. 2, pp. 551–603 (1999)
Fujaba Developer Team: Fujaba-Homepage (2005), http://www.fujaba.de/
Varró, G., Friedl, K., Varró, D.: Graph Transformations in Relational Databases. In: Proc. GraBaTs 2004: Intl. Workshop on Graph Based Tools. Elsevier, Amsterdam (2004)
Varró, G., Schürr, A., Varró, D.: Benchmarking for Graph Transformation. Technical report, Department of Computer Science and Information Theory, Budapest University of Technology and Economics (2005)
Batz, G.V.: Graphersetzung für eine Zwischendarstellung im Übersetzerbau. Master’s thesis, Universität Karlsruhe (2005)
Dörr, H.: Efficient Graph Rewriting and Its Implementation. LNCS, vol. 922. Springer, Heidelberg (1995)
Batz, G.V.: An Optimization Technique for Subgraph Matching Strategies. Technical Report 2006-7, Universität Karlsruhe, Fakultät für Informatik (2006)
Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach. In: [24], vol. 1, pp. 247–312 (1999)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic Approaches to Graph Transformation - Part I: Basic concepts and double pushout approach. In: [24], vol. 1, pp. 163–245 (1999)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. Springer, Heidelberg (2006)
Szalkowski, A.M.: Negative Anwendungsbedingungen für das suchprogrammbasierte Backend von GrGen, Studienarbeit, Universität Karlsruhe (2005)
Hack, S.: Graphersetzung für Optimierungen in der Codeerzeugung. Master’s thesis, Universität Karlsruhe (2003)
Grund, D.: Negative Anwendungsbedingungen für den Graphersetzer GRGEN, Studienarbeit, Universität Karlsruhe (2004)
Schürr, A.: Logic based programmed structure rewriting systems. Fundamenta Informaticae, Special Issues on Graph Transformations 26(3/4) (1996)
Zündorf, A.: Graph Pattern Matching in PROGRESS. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 454–468. Springer, Heidelberg (1996)
Rudolf, M.: Utilizing constraint satisfaction techniques for efficient graph pattern matching. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 238–252. Springer, Heidelberg (2000)
Varró, G.: Graph transformation benchmarks page (2005), http://www.cs.bme.hu/~gervarro/benchmark/2.0/
Assmann, U.: Graph rewrite systems for program optimization. ACM Trans. Program. Lang. Syst. 22(4), 583–637 (2000)
Varró, G., Varró, D., Friedl, K.: Adaptive graph pattern matching for model transformations using model-sensitive search plans. In: Karsai, G., Taentzer, G. (eds.) Proc. of Int. Workshop on Graph and Model Transformation (GraMoT 2005), Tallinn, Estonia. ENTCS, vol. 152, pp. 191–205. Elsevier, Amsterdam (2005)
Standard Performance Evaluation Corporation: All SPEC CPU2000 results published by SPEC page (2005), http://www.spec.org/cpu2000/results/cpu2000.html
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific, Singapore (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geiß, R., Batz, G.V., Grund, D., Hack, S., Szalkowski, A. (2006). GrGen: A Fast SPO-Based Graph Rewriting Tool. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds) Graph Transformations. ICGT 2006. Lecture Notes in Computer Science, vol 4178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841883_27
Download citation
DOI: https://doi.org/10.1007/11841883_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38870-8
Online ISBN: 978-3-540-38872-2
eBook Packages: Computer ScienceComputer Science (R0)