Detlef Plump

	2009
42		Detlef Plump: The Graph Programming Language GP. CAI 2009: 99-122
	2008
41		Greg Manning, Detlef Plump: The GP Programming System. ECEASST 10: (2008)
40		Mike Dodds, Detlef Plump: From Hyperedge Replacement to Separation Logic and Back. ECEASST 16: (2008)
39		Ian Mackie, Detlef Plump: Preface. Electr. Notes Theor. Comput. Sci. 203(1): 1-2 (2008)
38		Greg Manning, Detlef Plump: The York Abstract Machine. Electr. Notes Theor. Comput. Sci. 211: 231-240 (2008)
	2007
37		Gabriele Taentzer, Enrico Biermann, Dénes Bisztray, Bernd Bohnet, Iovka Boneva, Artur Boronat, Leif Geiger, Rubino Geiß, Ákos Horvath, Ole Kniemeyer, Tom Mens, Benjamin Ness, Detlef Plump, Tamás Vajk: Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools. AGTIVE 2007: 514-539
36		Ian Mackie, Detlef Plump: Preface. Electr. Notes Theor. Comput. Sci. 72(1): 1-2 (2007)
35		Ian Mackie, Detlef Plump: Theory and applications of term graph rewriting: introduction. Mathematical Structures in Computer Science 17(3): 361-362 (2007)
	2006
34		Mike Dodds, Detlef Plump: Graph Transformation in Constant Time. ICGT 2006: 367-382
33		Mike Dodds, Detlef Plump: Extending C for Checking Shape Safety. Electr. Notes Theor. Comput. Sci. 154(2): 95-112 (2006)
	2005
32		Detlef Plump: Confluence of Graph Transformation Revisited. Processes, Terms and Cycles 2005: 280-308
	2004
31		Detlef Plump, Sandra Steinert: Towards Graph Programs for Graph Algorithms. ICGT 2004: 128-143
	2003
30		Adam Bakewell, Detlef Plump, Colin Runciman: Specifying Pointer Structures by Graph Reduction. AGTIVE 2003: 30-44
29		J. B. Wells, Detlef Plump, Fairouz Kamareddine: Diagrams for Meaning Preservation. RTA 2003: 88-106
28		Adam Bakewell, Detlef Plump, Colin Runciman: Checking the Shape Safety of Pointer Manipulations. RelMiCS 2003: 48-61
	2002
27		Annegret Habel, Detlef Plump: Relabelling in Graph Transformation. ICGT 2002: 135-147
26		Detlef Plump: TERMGRAPH 2002 - Workshop Survey. ICGT 2002: 435-439
25		Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64(2): 249-283 (2002)
	2001
24		Annegret Habel, Detlef Plump: Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245
23		Detlef Plump: Essentials of Term Graph Rewriting. Electr. Notes Theor. Comput. Sci. 51: (2001)
22		Annegret Habel, Detlef Plump: Solving Equations by Graph Transformation. Electr. Notes Theor. Comput. Sci. 51: (2001)
21		Annegret Habel, Jürgen Müller, Detlef Plump: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5): 637-688 (2001)
	2000
20		Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. FoSSaCS 2000: 98-113
19		Zena M. Ariola, Jan Willem Klop, Detlef Plump: Bisimilarity in Term Graph Rewriting. Inf. Comput. 156(1-2): 2-24 (2000)
	1999
18		Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, Gabriele Taentzer: Graph Transformation for Specification and Programming. Sci. Comput. Program. 34(1): 1-54 (1999)
	1998
17		Annegret Habel, Jürgen Müller, Detlef Plump: Double-Pushout Approach with Injective Matching. TAGT 1998: 103-116
16		Annegret Habel, Detlef Plump: Complete Strategies for Term Graph Narrowing. WADT 1998: 152-167
15		Detlef Plump: Termination of Graph Rewriting is Undecidable. Fundam. Inform. 33(2): 201-209 (1998)
	1997
14		Detlef Plump: Simplification Orders for Term Graph Rewriting. MFCS 1997: 458-467
13		Zena M. Ariola, Jan Willem Klop, Detlef Plump: Confluent rewriting of bisimilar term graphs. Electr. Notes Theor. Comput. Sci. 7: (1997)
	1996
12		Annegret Habel, Detlef Plump: Term Graph Narrowing. Mathematical Structures in Computer Science 6(6): 649-676 (1996)
	1995
11		Detlef Plump: On Termination of Graph Rewriting. WG 1995: 88-100
10		Annegret Habel, Detlef Plump: Unification, rewriting, and narrowing on term graphs. Electr. Notes Theor. Comput. Sci. 2: (1995)
	1994
9		Detlef Plump: Critical Pairs in Term Graph Rewriting. MFCS 1994: 556-566
8		Detlef Plump, Annegret Habel: Graph Unification and Matching. TAGT 1994: 75-88
	1992
7		Detlef Plump: Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. CTRS 1992: 97-112
	1991
6		Annegret Habel, Hans-Jörg Kreowski, Detlef Plump: Jungle evaluation. Fundam. Inform. 15(1): 37-60 (1991)
5		Berthold Hoffmann, Detlef Plump: Implementing term rewriting by jungle evaluation. ITA 25: 445-472 (1991)
	1990
4		Detlef Plump: Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems. CTRS 1990: 307-317
3		Detlef Plump: Graph-Reducible Term Rewriting Systems. Graph-Grammars and Their Application to Computer Science 1990: 622-636
	1988
2		Berthold Hoffmann, Detlef Plump: Jungle Evaluation for Efficient Term Rewriting. ALP 1988: 191-203
	1987
1		Annegret Habel, Hans-Jörg Kreowski, Detlef Plump: Jungle Evaluation. ADT 1987: 92-112

Coauthor Index

1	Marc Andries	[18]
2	Zena M. Ariola	[13] [19]
3	Adam Bakewell	[28] [30]
4	Enrico Biermann	[37]
5	Dénes Bisztray	[37]
6	Bernd Bohnet	[37]
7	Iovka Boneva	[37]
8	Artur Boronat	[37]
9	Mike Dodds	[33] [34] [40]
10	Frank Drewes	[20] [25]
11	Gregor Engels	[18]
12	Leif Geiger	[37]
13	Rubino Geiß	[37]
14	Annegret Habel	[1] [6] [8] [10] [12] [16] [17] [18] [21] [22] [24] [27]
15	Berthold Hoffmann	[2] [5] [18] [20] [25]
16	Ákos Horvath	[37]
17	Fairouz Kamareddine	[29]
18	Jan Willem Klop	[13] [19]
19	Ole Kniemeyer	[37]
20	Hans-Jörg Kreowski	[1] [6] [18]
21	Sabine Kuske	[18]
22	Ian Mackie	[35] [36] [39]
23	Greg Manning	[38] [41]
24	Tom Mens	[37]
25	Jürgen Müller	[17] [21]
26	Benjamin Ness	[37]
27	Colin Runciman	[28] [30]
28	Andy Schürr	[18]
29	Sandra Steinert	[31]
30	Gabriele Taentzer	[18] [37]
31	Tamás Vajk	[37]
32	J. B. Wells	[29]

Colors in the list of coauthors