Detlef Plump

Rachid Echahed, Detlef Plump (Eds.): Proceedings 7th International Workshop on Computing with Terms and Graphs. EPTCS 110, 2013

Detlef Plump, Christopher Bak: Rooted Graph Programs. ECEASST 54 (2012)

Christopher M. Poskitt, Detlef Plump: Hoare-Style Verification of Graph Programs. Fundam. Inform. 118(1-2): 135-175 (2012)

Annegret Habel, Detlef Plump: $\mathcal M, \mathcal N$ -Adhesive Transformation Systems. ICGT 2012: 218-233

Detlef Plump, Robin Suri, Ambuj Singh: Minimizing Finite Automata with Graph Programs. ECEASST 39 (2011)

Detlef Plump: The Design of GP 2. WRS 2011: 1-16

Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump: Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. ECEASST 26 (2010)

Detlef Plump: Checking Graph-Transformation Systems for Confluence. ECEASST 26 (2010)

Christopher M. Poskitt, Detlef Plump: A Hoare Calculus for Graph Programs. ICGT 2010: 139-154

Detlef Plump: The Graph Programming Language GP. CAI 2009: 99-122

Detlef Plump, Sandra Steinert: The Semantics of Graph Programs. RULE 2009: 27-38

Greg Manning, Detlef Plump: The GP Programming System. ECEASST 10 (2008)

Mike Dodds, Detlef Plump: From Hyperedge Replacement to Separation Logic and Back. ECEASST 16 (2008)

Ian Mackie, Detlef Plump: Preface. Electr. Notes Theor. Comput. Sci. 203(1): 1-2 (2008)

Greg Manning, Detlef Plump: The York Abstract Machine. Electr. Notes Theor. Comput. Sci. 211: 231-240 (2008)

Ian Mackie, Detlef Plump: Preface. Electr. Notes Theor. Comput. Sci. 72(1): 1-2 (2007)

Ian Mackie, Detlef Plump: Theory and applications of term graph rewriting: introduction. Mathematical Structures in Computer Science 17(3): 361-362 (2007)

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

Mike Dodds, Detlef Plump: Extending C for Checking Shape Safety. Electr. Notes Theor. Comput. Sci. 154(2): 95-112 (2006)

Mike Dodds, Detlef Plump: Graph Transformation in Constant Time. ICGT 2006: 367-382

Detlef Plump: Confluence of Graph Transformation Revisited. Processes, Terms and Cycles 2005: 280-308

Detlef Plump, Sandra Steinert: Towards Graph Programs for Graph Algorithms. ICGT 2004: 128-143

Adam Bakewell, Detlef Plump, Colin Runciman: Checking the Shape Safety of Pointer Manipulations. RelMiCS 2003: 48-61

Adam Bakewell, Detlef Plump, Colin Runciman: Specifying Pointer Structures by Graph Reduction. AGTIVE 2003: 30-44

J. B. Wells, Detlef Plump, Fairouz Kamareddine: Diagrams for Meaning Preservation. RTA 2003: 88-106

Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64(2): 249-283 (2002)

Annegret Habel, Detlef Plump: Relabelling in Graph Transformation. ICGT 2002: 135-147

Detlef Plump: TERMGRAPH 2002 - Workshop Survey. ICGT 2002: 435-439

Annegret Habel, Detlef Plump: Solving Equations by Graph Transformation. Electr. Notes Theor. Comput. Sci. 51: 165-176 (2001)

Detlef Plump: Essentials of Term Graph Rewriting. Electr. Notes Theor. Comput. Sci. 51: 277-289 (2001)

Annegret Habel, Jürgen Müller, Detlef Plump: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5): 637-688 (2001)

Annegret Habel, Detlef Plump: Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245

Zena M. Ariola, Jan Willem Klop, Detlef Plump: Bisimilarity in Term Graph Rewriting. Inf. Comput. 156(1-2): 2-24 (2000)

Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. FoSSaCS 2000: 98-113

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)

Detlef Plump: Termination of Graph Rewriting is Undecidable. Fundam. Inform. 33(2): 201-209 (1998)

Annegret Habel, Jürgen Müller, Detlef Plump: Double-Pushout Approach with Injective Matching. TAGT 1998: 103-116

Annegret Habel, Detlef Plump: Complete Strategies for Term Graph Narrowing. WADT 1998: 152-167

Zena M. Ariola, Jan Willem Klop, Detlef Plump: Confluent rewriting of bisimilar term graphs. Electr. Notes Theor. Comput. Sci. 7: 19 (1997)

Detlef Plump: Simplification Orders for Term Graph Rewriting. MFCS 1997: 458-467

Annegret Habel, Detlef Plump: Term Graph Narrowing. Mathematical Structures in Computer Science 6(6): 649-676 (1996)

Annegret Habel, Detlef Plump: Unification, rewriting, and narrowing on term graphs. Electr. Notes Theor. Comput. Sci. 2: 110-117 (1995)

Detlef Plump: On Termination of Graph Rewriting. WG 1995: 88-100

Detlef Plump: Critical Pairs in Term Graph Rewriting. MFCS 1994: 556-566

Detlef Plump, Annegret Habel: Graph Unification and Matching. TAGT 1994: 75-88

Detlef Plump: Evaluation of functional expressions by hypergraph rewriting. Universität Bremen 1993, pp. I-VI, 1-119

Detlef Plump: Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. CTRS 1992: 97-112

Annegret Habel, Hans-Jörg Kreowski, Detlef Plump: Jungle evaluation. Fundam. Inform. 15(1): 37-60 (1991)

Berthold Hoffmann, Detlef Plump: Implementing term rewriting by jungle evaluation. ITA 25: 445-472 (1991)

Detlef Plump: Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems. CTRS 1990: 307-317

Detlef Plump: Graph-Reducible Term Rewriting Systems. Graph-Grammars and Their Application to Computer Science 1990: 622-636

Berthold Hoffmann, Detlef Plump: Jungle Evaluation for Efficient Term Rewriting. ALP 1988: 191-203

Annegret Habel, Hans-Jörg Kreowski, Detlef Plump: Jungle Evaluation. ADT 1987: 92-112