Refereed Papers in Journals, Collections, Conference Proceedings and Workshop Proceedings

• A. Habel and D. Plump
  M,N-Adhesive Transformation Systems
  Proc. International Conference on Graph Transformation (ICGT 2012) , Lecture Notes in Computer Science 7562, pages 218-233. © Springer-Verlag, 2012.

• C. Bak and D. Plump
  Rooted Graph Programs
  Proc. International Workshop on Graph Based Tools (GraBaTs 2012), Electronic Communications of the EASST 54, 2012.

• C. Poskitt and D. Plump
  Verifying Total Correctness of Graph Programs
  Proc. International Workshop on Graph Computation Models (GCM 2012), 2012. Revised version to appear in Electronic Communications of the EASST.

• A. Bakewell, D. Plump and C. Runciman
  Specifying Pointer Structures by Graph Reduction
  Mathematical Structures in Computer Science, to appear

• D. Plump
  The Design of GP 2
  Proc. International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), Electronic Proceedings in Theoretical Computer Science 82, pages 1-16, 2012

• C.M. Poskitt and D. Plump
  Hoare-Style Verification of Graph Programs
  Fundamenta Informaticae 118(1-2):135-175, 2012

• D. Plump, R. Suri and A. Singh
  Minimizing Finite Automata with Graph Programs
  Graph Computation Models (GCM 2010), Revised Selected Papers, Electronic Communications of the EASST 39, 2011

• D. Plump
  Checking Graph-Transformation Systems for Confluence
  In Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday, Electronic Communications of the EASST 26, 2010

• C.M. Poskitt and D. Plump
  A Hoare Calculus for Graph Programs
  Proc. International Conference on Graph Transformation (ICGT 2010), Lecture Notes in Computer Science 6372, pages 139-154. © Springer-Verlag, 2010

• C.M. Poskitt and D. Plump
  Hoare Logic for Graph Programs
  Proc. THEORY Workshop at Verified Software: Theories, Tools and Experiments (VS-THEORY 2010), 2010

• D. Plump
  Graph Programs
  Proc. International Workshop on Strategies in Rewriting, Proving, and Programming (IWS 2010), pages 39-44, 2010

• D. Plump and S. Steinert
  The Semantics of Graph Programs
  Proc. Rule-Based Programming (RULE 2009), Electronic Proceedings in Theoretical Computer Science 21, pages 27-38, 2010

• D. Plump
  The Graph Programming Language GP
  Proc. International Conference on Algebraic Informatics (CAI 2009), Lecture Notes in Computer Science 5725, pages 99-122. © Springer-Verlag, 2009

• M. Dodds and D. Plump
  From Hyperedge Replacement to Separation Logic and Back
  Proc. Doctoral Symposium at the International Conference on Graph Transformation (ICGT-DS 2008), Electronic Communications of the EASST 16, 2009

• G. Manning and D. Plump
  The GP Programming System
  Proc. Graph Transformation and Visual Modelling Techniques (GT-VMT 2008), Electronic Communications of the EASST 10, 2008

• G. Taentzer, E. Biermann, D. Bisztray, B. Bohnet, I. Boneva, A. Boronat, L. Geiger, R. Geiss, A. Horvath, O. Kniemeyer, T. Mens, B. Ness, D. Plump and T. Vajk
  Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools
  Applications of Graph Transformation with Industrial Relevance (AGTIVE 2007), Revised Selected and Invited Papers, Lecture Notes in Computer Science 5088, pages 514-539. © Springer-Verlag, 2008

• G. Manning and D. Plump
  The York Abstract Machine
  Proc. Graph Transformation and Visual Modelling Techniques (GT-VMT 2006), Electronic Notes in Theoretical Computer Science 211, pages 231-240. Elsevier, 2008

• M. Dodds and D. Plump
  Graph Transformation in Constant Time
  Proc. International Conference on Graph Transformation (ICGT 2006) , Lecture Notes in Computer Science 4178, pages 367-382. © Springer-Verlag, 2006

• M. Dodds and D. Plump
  Extending C for Checking Shape Safety
  Proc. Graph Transformation for Verification and Concurrency (GT-VC 2005), Electronic Notes in Theoretical Computer Science 154(2), pages 95-112. Elsevier, 2006

• D. Plump
  Confluence of Graph Transformation Revisited
  In Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 3838, pages 280-308, eds. A. Middeldorp, V. van Oostrom, F. van Raamsdonk and R. de Vrijer. © Springer-Verlag, 2005

• D. Plump and S. Steinert
  Towards Graph Programs for Graph Algorithms
  Proc. International Conference on Graph Transformation (ICGT 2004) , Lecture Notes in Computer Science 3256, pages 128-143. © Springer-Verlag, 2004

• A. Bakewell, D. Plump and C. Runciman
  Specifying Pointer Structures by Graph Reduction
  Applications of Graph Transformations with Industrial Relevance (AGTIVE 2003), Revised Selected and Invited Papers, Lecture Notes in Computer Science 3062, pages 30-44. © Springer-Verlag, 2004

• A. Bakewell, D. Plump and C. Runciman
  Checking the Shape Safety of Pointer Manipulations
  Relational Methods in Computer Science (RelMiCS 7), Revised Selected Papers, Lecture Notes in Computer Science 3051, pages 48-61. © Springer-Verlag, 2004

• J. Wells, D. Plump and F. Kamareddine
  Diagrams for Meaning Preservation
  Proc. International Conference on Rewriting Techniques and Applications (RTA 2003), Lecture Notes in Computer Science 2706, pages 88-106. © Springer-Verlag, 2003

• F. Drewes, B. Hoffmann and D. Plump
  Hierarchical Graph Transformation
  Journal of Computer and System Sciences 64(2):249-283, 2002

• A. Habel and D. Plump
  Relabelling in Graph Transformation
  Proc. International Conference on Graph Transformation (ICGT 2002) , Lecture Notes in Computer Science 2505, pages 135-147. © Springer-Verlag, 2002

• D. Plump
  Essentials of Term Graph Rewriting
  Proc. GETGRATS Closing Workshop, Electronic Notes in Theoretical Computer Science 51, pages 277-289. Elsevier, 2002

• A. Habel and D. Plump
  Solving Equations by Graph Transformation
  Proc. GETGRATS Closing Workshop, Electronic Notes in Theoretical Computer Science 51, pages 165-176. Elsevier, 2002

• A. Habel, J. Müller and D. Plump
  Double-Pushout Graph Transformation Revisited
  Mathematical Structures in Computer Science 11(5):637-688, 2001

• A. Habel and D. Plump
  Computational Completeness of Programming Languages Based on Graph Transformation
  Proc. Foundations of Software Science and Computation Structures (FOSSACS 2001), Lecture Notes in Computer Science 2030, pages 230-245. © Springer-Verlag, 2001

• Z.M. Ariola, J.W. Klop and D. Plump
  Bisimilarity in Term Graph Rewriting
  Information and Computation 156(1/2):2-24, 2000

• A. Habel, J. Müller and D. Plump
  Double-Pushout Approach with Injective Matching
  Theory and Application of Graph Transformation (TAGT '98), Selected Papers, Lecture Notes in Computer Science 1764, pages 103-117. © Springer-Verlag, 2000

• F. Drewes, B. Hoffmann and D. Plump
  Hierarchical Graph Transformation
  Proc. Foundations of Software Science and Computation Structures (FOSSACS 2000), Lecture Notes in Computer Science 1784, pages 98-113. Springer-Verlag, 2000

• D. Plump
  Term Graph Rewriting
  In Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools, Chapter 1, pages 3-61, eds. H. Ehrig, G. Engels, H.-J. Kreowski and G. Rozenberg. World Scientific, 1999

• M. Andries, G. Engels, A. Habel, B. Hoffmann, H.-J. Kreowski, S. Kuske, D. Plump, A. Schürr and G. Taentzer
  Graph Transformation for Specification and Programming
  Science of Computer Programming 34(1):1-54, 1999

• A. Habel and D. Plump
  Complete Strategies for Term Graph Narrowing
  Recent Trends in Algebraic Development Techniques, Selected Papers , Lecture Notes in Computer Science 1589, pages 152-167. © Springer-Verlag, 1999

• D. Plump
  Termination of Graph Rewriting is Undecidable
  Fundamenta Informaticae 33(2):201-209, 1998

• Z.M. Ariola, J.W. Klop and D. Plump
  Confluent Rewriting of Bisimilar Term Graphs
  Proc. Fourth Workshop on Expressiveness in Concurrency, Electronic Notes in Theoretical Computer Science 7. Elsevier, 1997

• D. Plump
  Simplification Orders for Term Graph Rewriting
  Proc. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1295, pages 458-467. © Springer-Verlag, 1997

• A. Habel and D. Plump
  Term Graph Narrowing
  Mathematical Structures in Computer Science 6(6):649-676, 1996

• D. Plump and A. Habel
  Graph Unification and Matching
  Proc. Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 1073, pages 75-89. © Springer-Verlag, 1996

• D. Plump
  On Termination of Graph Rewriting
  Proc. Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1017, pages 88-100. Springer-Verlag, 1995

• A. Habel and D. Plump
  Unification, Rewriting, and Narrowing on Term Graphs
  Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA '95), Electronic Notes in Theoretical Computer Science 2. Elsevier, 1995

• D. Plump
  Critical Pairs in Term Graph Rewriting
  Proc. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 841, pages 556-566. Springer-Verlag, 1994

• D. Plump
  Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence
  In Term Graph Rewriting: Theory and Practice, chapter 15, pages 201-213
  eds. M.R. Sleep, M.J. Plasmeijer and M.C.J.D. van Eekelen. John Wiley, 1993

• D. Plump
  Collapsed Tree Rewriting: Completeness, Confluence, and Modularity
  Proc. Conditional Term Rewriting Systems, Lecture Notes in Computer Science 656, pages 97-112. Springer-Verlag, 1993

• B. Hoffmann and D. Plump
  Implementing Term Rewriting by Jungle Evaluation
  RAIRO Theoretical Informatics and Applications 25(5):445-472, 1991

• A. Habel, H.-J. Kreowski and D. Plump
  Jungle Evaluation
  Fundamenta Informaticae 15(1):37-60, 1991

• D. Plump
  Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems
  Proc. Conditional and Typed Rewriting Systems, Lecture Notes in Computer Science 516, pages 307-317. Springer-Verlag, 1991

• D. Plump
  Graph-Reducible Term Rewriting Systems
  Proc. Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 532, pages 622-636. Springer-Verlag, 1991

• B. Hoffmann and D. Plump
  Jungle Evaluation for Efficient Term Rewriting
  Proc. Algebraic and Logic Programming, Mathematical Research 49, pages 191-203, Akademie-Verlag, 1988. Also in Lecture Notes in Computer Science 343, pages 191-203. Springer-Verlag, 1989

• A. Habel, H.-J. Kreowski and D. Plump
  Jungle Evaluation
  Recent Trends in Data Type Specification, Selected Papers, Lecture Notes in Computer Science 332, pages 92-112. Springer-Verlag, 1988

Edited Books, Journal Issues and Proceedings

• R. Echahed and D. Plump (eds.)
  Proceedings Seventh International Workshop on Computing with Terms and Graphs (TERMGRAPH 2013)
  Electronic Proceedings in Theoretical Computer Science 110, 2013

• F. Drewes, A. Habel, B. Hoffmann and D. Plump (eds.)
  Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday
  Electronic Communications of the EASST 26, 2010

• F. Drewes, A. Habel, B. Hoffmann and D. Plump (eds.)
  Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday
  Festschrift, 356 pages, 2010

• I. Mackie and D. Plump (eds.)
  Proceedings Fourth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2007)
  Electronic Notes in Theoretical Computer Science 203(1), 2008

• I. Mackie and D. Plump (eds.)
  Theory and Applications of Term Graph Rewriting
  Mathematical Structures in Computer Science 17(3):361-584, 2007

• I. Mackie and D. Plump (eds.)
  Proceedings First International Workshop on Term Graph Rewriting (TERMGRAPH 2002)
  Electronic Notes in Theoretical Computer Science 72(1), 2007

Theses

• D. Plump
  Computing by Graph Rewriting
  Habilitation thesis, Universität Bremen, Fachbereich Mathematik und Informatik, 193 pages, 1999

• D. Plump
  Evaluation of Functional Expressions by Hypergraph Rewriting
  Doctoral thesis, Universität Bremen, Fachbereich Mathematik und Informatik, 119 pages, 1993

Other Publications

• D. Plump, R. Suri and A. Singh
  Minimizing Finite Automata with Graph Programs
  Proc. International Workshop on Graph Computation Models (GCM 2010), CTIT Workshop Proceedings WP 2010-05, pages 97-110. University of Twente, 2010

• A. Bakewell, D. Plump and C. Runciman
  Specifying Pointer Structures by Graph Reduction
  Technical Report YCS-2003-367, The University of York, 48 pages, 2003

• A. Bakewell, D. Plump and C. Runciman
  Checking the Shape Safety of Pointer Manipulations (Extended Abstract)
  Preliminary Proc. International Seminar on Relational Methods in Computer Science (RelMiCS 7), pages 144-151, Universität Kiel, 2003

• D. Plump
  TERMGRAPH 2002 - Workshop Survey
  Proc. International Conference on Graph Transformation (ICGT 2002) , Lecture Notes in Computer Science 2505, pages 435-439. © Springer-Verlag, 2002

• A. Habel and D. Plump
  A Core Language for Graph Transformation
  Proc. Workshop on Applied Graph Transformation (AGT 2002), pages 187-199, 2002

• H.-J. Kreowski and D. Plump (eds.)
  APPLIGRAPH: Applications of Graph Transformation - ESPRIT Working Group No. 22565
  Final report, Universität Bremen, 98 pages, 2002

• F. Drewes, B. Hoffmann and D. Plump
  Hierarchical Graph Transformation
  Informatik-Bericht Nr. 1/2000, Fachbereich Mathematik und Informatik, Universität Bremen, 33 pages, 2000

• A. Habel, J. Müller and D. Plump
  Double-Pushout Graph Transformation Revisited
  Bericht Nr. 7/99, Fachbereich Informatik, Universität Oldenburg, 68 pages, 1999
  

• D. Plump
  Church-Rosser Hypergraph Languages
  Proc. 9. Theorietag Automaten und Formale Sprachen, Mathematische Schriften Kassel 12/99, Universität Kassel, Fachbereich Mathematik/Informatik, 1999

• D. Plump
  Term Graph Rewriting
  Report CSI-R9822, Computing Science Institute, Katholieke Universiteit Nijmegen, 63 pages, 1998

• Z.M. Ariola, J.W. Klop and D. Plump
  Bisimilarity in Term Graph Rewriting
  Report SEN-R9801, CWI, Amsterdam, 22 pages, 1998

• A. Habel and D. Plump
  Completeness of Narrowing in Non-copying Implementations
  Informatik-Bericht Nr. 19/97, Universität Hildesheim, 21 pages, 1997

• D. Plump
  Termination of Graph Rewriting is Undecidable
  Informatik-Bericht Nr. 7/97, Universität Bremen, 10 pages, 1997

• M. Andries, G. Engels, A. Habel, B. Hoffmann, H.-J. Kreowski, S. Kuske, D. Plump, A. Schürr and G. Taentzer
  Graph Transformation for Specification and Programming
  Informatik-Bericht Nr. 7/96, Universität Bremen, 50 pages, 1996

• A. Habel and D. Plump
  Term Graph Narrowing
  Informatik-Bericht Nr. 14/96, Universität Hildesheim, 28 pages, 1996
  Short version in Proc. Tenth International Workshop on Unification (UNIF '96), CIS-Bericht 96-91, Universität München, 1996

• D. Plump
  Dschungelersetzung
  Proc. Alternative Konzepte für Sprachen und Rechner - Bad Honnef 1994, Bericht Nr. 9412, pages 104-107, Institut für Informatik und Praktische Informatik, Christian-Albrechts-Universität Kiel, 1994

• B. Krieg-Brückner and D. Plump
  COMPASS: A Comprehensive Algebraic Approach to System Specification and Development - ESPRIT Basic Research Working Group No. 3264
  EATCS Bulletin 47:87-90, 1992

• A. Corradini and D. Plump
  Jungle Rewriting: A New Paradigm for the Implementation of Functional and Logic Programming Languages
  Computing by Graph Transformation (COMPUGRAPH), ESPRIT Basic Research Working Group No. 3299 - Survey, Results, and Applications
  Technische Universität Berlin, 1992

• D. Plump
  A Critical Pair Lemma for Graph Rewriting
  Proc. SemaGraph Symposium on the Semantics and Pragmatics of Generalized Graph Rewriting, Technical Report 91-25, pages 381-394, University of Nijmegen, Department of Informatics, 1991

• B. Krieg-Brückner and D. Plump (eds.)
  COMPASS: A Comprehensive Algebraic Approach to System Specification and Development - Final Report
  Informatik-Bericht Nr. 7/91, Universität Bremen, 104 pages, 1991

• D. Plump
  Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems
  Proc. 2nd German Workshop on Term Rewriting, Forschungsbericht Nr. 336, pages 13-16, Fachbereich Informatik, Universität Dortmund, 1990

• B. Hoffmann and D. Plump
  Term Rewriting and Jungle Evaluation: Similarities and Differences
  Proc. Funktionale und logische Programmierung - Sprachen, Methoden, Implementationen, Bericht Nr. 214, pages 78-83, Institut für Mathematik, Universität Augsburg, 1989

• B. Hoffmann and D. Plump
  Jungle Evaluation for Efficient Term Rewriting
  Informatik-Bericht Nr. 4/88, Universität Bremen, 62 pages, 1988
  Short version in Proc. 1st German Workshop on Term Rewriting, SEKI Report SR-89-02, Fachbereich Informatik, Universität Kaiserslautern, 1989