The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Detlef Plump: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Adam Bakewell, Detlef Plump, Colin Runciman
    Checking the Shape Safety of Pointer Manipulations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2003, pp:48-61 [Conf]
  2. Annegret Habel, Hans-Jörg Kreowski, Detlef Plump
    Jungle Evaluation. [Citation Graph (0, 0)][DBLP]
    ADT, 1987, pp:92-112 [Conf]
  3. Adam Bakewell, Detlef Plump, Colin Runciman
    Specifying Pointer Structures by Graph Reduction. [Citation Graph (0, 0)][DBLP]
    AGTIVE, 2003, pp:30-44 [Conf]
  4. Berthold Hoffmann, Detlef Plump
    Jungle Evaluation for Efficient Term Rewriting. [Citation Graph (0, 0)][DBLP]
    ALP, 1988, pp:191-203 [Conf]
  5. Detlef Plump
    Confluence of Graph Transformation Revisited. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:280-308 [Conf]
  6. Detlef Plump
    Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1990, pp:307-317 [Conf]
  7. Detlef Plump
    Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:97-112 [Conf]
  8. Frank Drewes, Berthold Hoffmann, Detlef Plump
    Hierarchical Graph Transformation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2000, pp:98-113 [Conf]
  9. Annegret Habel, Detlef Plump
    Computational Completeness of Programming Languages Based on Graph Transformation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:230-245 [Conf]
  10. Mike Dodds, Detlef Plump
    Graph Transformation in Constant Time. [Citation Graph (0, 0)][DBLP]
    ICGT, 2006, pp:367-382 [Conf]
  11. Annegret Habel, Detlef Plump
    Relabelling in Graph Transformation. [Citation Graph (0, 0)][DBLP]
    ICGT, 2002, pp:135-147 [Conf]
  12. Detlef Plump
    TERMGRAPH 2002 - Workshop Survey. [Citation Graph (0, 0)][DBLP]
    ICGT, 2002, pp:435-439 [Conf]
  13. Detlef Plump
    Graph-Reducible Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:622-636 [Conf]
  14. Detlef Plump, Sandra Steinert
    Towards Graph Programs for Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    ICGT, 2004, pp:128-143 [Conf]
  15. Detlef Plump
    Critical Pairs in Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:556-566 [Conf]
  16. Detlef Plump
    Simplification Orders for Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:458-467 [Conf]
  17. J. B. Wells, Detlef Plump, Fairouz Kamareddine
    Diagrams for Meaning Preservation. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:88-106 [Conf]
  18. Annegret Habel, Jürgen Müller, Detlef Plump
    Double-Pushout Approach with Injective Matching. [Citation Graph (0, 0)][DBLP]
    TAGT, 1998, pp:103-116 [Conf]
  19. Detlef Plump, Annegret Habel
    Graph Unification and Matching. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:75-88 [Conf]
  20. Annegret Habel, Detlef Plump
    Complete Strategies for Term Graph Narrowing. [Citation Graph (0, 0)][DBLP]
    WADT, 1998, pp:152-167 [Conf]
  21. Detlef Plump
    On Termination of Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:88-100 [Conf]
  22. Zena M. Ariola, Jan Willem Klop, Detlef Plump
    Confluent rewriting of bisimilar term graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
  23. Mike Dodds, Detlef Plump
    Extending C for Checking Shape Safety. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:154, n:2, pp:95-112 [Journal]
  24. Annegret Habel, Detlef Plump
    Solving Equations by Graph Transformation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:51, n:, pp:- [Journal]
  25. Annegret Habel, Detlef Plump
    Unification, rewriting, and narrowing on term graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  26. Detlef Plump
    Essentials of Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:51, n:, pp:- [Journal]
  27. Annegret Habel, Hans-Jörg Kreowski, Detlef Plump
    Jungle evaluation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:15, n:1, pp:37-60 [Journal]
  28. Detlef Plump
    Termination of Graph Rewriting is Undecidable. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:33, n:2, pp:201-209 [Journal]
  29. Zena M. Ariola, Jan Willem Klop, Detlef Plump
    Bisimilarity in Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:156, n:1-2, pp:2-24 [Journal]
  30. Berthold Hoffmann, Detlef Plump
    Implementing term rewriting by jungle evaluation. [Citation Graph (0, 0)][DBLP]
    ITA, 1991, v:25, n:, pp:445-472 [Journal]
  31. Frank Drewes, Berthold Hoffmann, Detlef Plump
    Hierarchical Graph Transformation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:2, pp:249-283 [Journal]
  32. Annegret Habel, Jürgen Müller, Detlef Plump
    Double-pushout graph transformation revisited. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2001, v:11, n:5, pp:637-688 [Journal]
  33. Annegret Habel, Detlef Plump
    Term Graph Narrowing. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1996, v:6, n:6, pp:649-676 [Journal]
  34. 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. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1999, v:34, n:1, pp:1-54 [Journal]

  35. Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools. [Citation Graph (, )][DBLP]


  36. A Hoare Calculus for Graph Programs. [Citation Graph (, )][DBLP]


  37. The Graph Programming Language GP. [Citation Graph (, )][DBLP]


  38. The Semantics of Graph Programs [Citation Graph (, )][DBLP]


  39. Preface. [Citation Graph (, )][DBLP]


  40. Preface. [Citation Graph (, )][DBLP]


  41. The York Abstract Machine. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002