Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Detlef Plump
2010 – today
- 2013
[j25]Christopher M. Poskitt, Detlef Plump: Verifying Total Correctness of Graph Programs. ECEASST 61 (2013)- [e1]Rachid Echahed, Detlef Plump (Eds.): Proceedings 7th International Workshop on Computing with Terms and Graphs. EPTCS 110, 2013
- 2012
- [j24]
- [j23]Christopher M. Poskitt, Detlef Plump: Hoare-Style Verification of Graph Programs. Fundam. Inform. 118(1-2): 135-175 (2012)
- [c27]Annegret Habel, Detlef Plump: $\mathcal M, \mathcal N$ -Adhesive Transformation Systems. ICGT 2012: 218-233
- 2011
- [j22]Detlef Plump, Robin Suri, Ambuj Singh: Minimizing Finite Automata with Graph Programs. ECEASST 39 (2011)
- [c26]
- 2010
- [j21]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)
- [j20]
- [c25]
2000 – 2009
- 2009
- [c24]
- [c23]
- 2008
- [j19]
- [j18]Mike Dodds, Detlef Plump: From Hyperedge Replacement to Separation Logic and Back. ECEASST 16 (2008)
- [j17]
- [j16]Greg Manning, Detlef Plump: The York Abstract Machine. Electr. Notes Theor. Comput. Sci. 211: 231-240 (2008)
- 2007
- [j15]
- [j14]Ian Mackie, Detlef Plump: Theory and applications of term graph rewriting: introduction. Mathematical Structures in Computer Science 17(3): 361-362 (2007)
- [c22]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
- 2006
- [j13]Mike Dodds, Detlef Plump: Extending C for Checking Shape Safety. Electr. Notes Theor. Comput. Sci. 154(2): 95-112 (2006)
- [c21]
- 2005
- [c20]Detlef Plump: Confluence of Graph Transformation Revisited. Processes, Terms and Cycles 2005: 280-308
- 2004
- [c19]
- 2003
- [c18]Adam Bakewell, Detlef Plump, Colin Runciman: Checking the Shape Safety of Pointer Manipulations. RelMiCS 2003: 48-61
- [c17]Adam Bakewell, Detlef Plump, Colin Runciman: Specifying Pointer Structures by Graph Reduction. AGTIVE 2003: 30-44
- [c16]
- 2002
- [j12]Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64(2): 249-283 (2002)
- [c15]
- [c14]
- 2001
- [j11]Annegret Habel, Detlef Plump: Solving Equations by Graph Transformation. Electr. Notes Theor. Comput. Sci. 51: 165-176 (2001)
- [j10]Detlef Plump: Essentials of Term Graph Rewriting. Electr. Notes Theor. Comput. Sci. 51: 277-289 (2001)
- [j9]Annegret Habel, Jürgen Müller, Detlef Plump: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5): 637-688 (2001)
- [c13]Annegret Habel, Detlef Plump: Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245
- 2000
- [j8]Zena M. Ariola, Jan Willem Klop, Detlef Plump: Bisimilarity in Term Graph Rewriting. Inf. Comput. 156(1-2): 2-24 (2000)
- [c12]Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. FoSSaCS 2000: 98-113
1990 – 1999
- 1999
- [j7]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
- [j6]
- [c11]Annegret Habel, Jürgen Müller, Detlef Plump: Double-Pushout Approach with Injective Matching. TAGT 1998: 103-116
- [c10]
- 1997
- [j5]Zena M. Ariola, Jan Willem Klop, Detlef Plump: Confluent rewriting of bisimilar term graphs. Electr. Notes Theor. Comput. Sci. 7: 19 (1997)
- [c9]
- 1996
- [j4]Annegret Habel, Detlef Plump: Term Graph Narrowing. Mathematical Structures in Computer Science 6(6): 649-676 (1996)
- 1995
- [j3]Annegret Habel, Detlef Plump: Unification, rewriting, and narrowing on term graphs. Electr. Notes Theor. Comput. Sci. 2: 110-117 (1995)
- [c8]
- 1994
- [c7]
- [c6]
- 1993
- [b1]Detlef Plump: Evaluation of functional expressions by hypergraph rewriting. Universität Bremen 1993, pp. I-VI, 1-119
- 1992
- [c5]
- 1991
- [j2]Annegret Habel, Hans-Jörg Kreowski, Detlef Plump: Jungle evaluation. Fundam. Inform. 15(1): 37-60 (1991)
- [j1]Berthold Hoffmann, Detlef Plump: Implementing term rewriting by jungle evaluation. ITA 25: 445-472 (1991)
- 1990
- [c4]Detlef Plump: Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems. CTRS 1990: 307-317
- [c3]Detlef Plump: Graph-Reducible Term Rewriting Systems. Graph-Grammars and Their Application to Computer Science 1990: 622-636
1980 – 1989
- 1988
- [c2]
- 1987
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:21 CEST by the dblp team