dblp.uni-trier.dewww.uni-trier.de

Detlef Plump Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
42EEDetlef Plump: The Graph Programming Language GP. CAI 2009: 99-122
2008
41EEGreg Manning, Detlef Plump: The GP Programming System. ECEASST 10: (2008)
40EEMike Dodds, Detlef Plump: From Hyperedge Replacement to Separation Logic and Back. ECEASST 16: (2008)
39EEIan Mackie, Detlef Plump: Preface. Electr. Notes Theor. Comput. Sci. 203(1): 1-2 (2008)
38EEGreg Manning, Detlef Plump: The York Abstract Machine. Electr. Notes Theor. Comput. Sci. 211: 231-240 (2008)
2007
37EEGabriele 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
36EEIan Mackie, Detlef Plump: Preface. Electr. Notes Theor. Comput. Sci. 72(1): 1-2 (2007)
35EEIan Mackie, Detlef Plump: Theory and applications of term graph rewriting: introduction. Mathematical Structures in Computer Science 17(3): 361-362 (2007)
2006
34EEMike Dodds, Detlef Plump: Graph Transformation in Constant Time. ICGT 2006: 367-382
33EEMike Dodds, Detlef Plump: Extending C for Checking Shape Safety. Electr. Notes Theor. Comput. Sci. 154(2): 95-112 (2006)
2005
32EEDetlef Plump: Confluence of Graph Transformation Revisited. Processes, Terms and Cycles 2005: 280-308
2004
31EEDetlef Plump, Sandra Steinert: Towards Graph Programs for Graph Algorithms. ICGT 2004: 128-143
2003
30EEAdam Bakewell, Detlef Plump, Colin Runciman: Specifying Pointer Structures by Graph Reduction. AGTIVE 2003: 30-44
29EEJ. B. Wells, Detlef Plump, Fairouz Kamareddine: Diagrams for Meaning Preservation. RTA 2003: 88-106
28EEAdam Bakewell, Detlef Plump, Colin Runciman: Checking the Shape Safety of Pointer Manipulations. RelMiCS 2003: 48-61
2002
27EEAnnegret Habel, Detlef Plump: Relabelling in Graph Transformation. ICGT 2002: 135-147
26EEDetlef Plump: TERMGRAPH 2002 - Workshop Survey. ICGT 2002: 435-439
25EEFrank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64(2): 249-283 (2002)
2001
24EEAnnegret Habel, Detlef Plump: Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245
23EEDetlef Plump: Essentials of Term Graph Rewriting. Electr. Notes Theor. Comput. Sci. 51: (2001)
22EEAnnegret 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
20EEFrank 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
16EEAnnegret 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
14EEDetlef Plump: Simplification Orders for Term Graph Rewriting. MFCS 1997: 458-467
13EEZena 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
11EEDetlef Plump: On Termination of Graph Rewriting. WG 1995: 88-100
10EEAnnegret Habel, Detlef Plump: Unification, rewriting, and narrowing on term graphs. Electr. Notes Theor. Comput. Sci. 2: (1995)
1994
9EEDetlef 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
2EEBerthold 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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)