Detlef Plump
Detlef Plump
Department of Computer Science, University of York
Verified email at york.ac.uk - Homepage
Title
Cited by
Cited by
Year
Graph transformation for specification and programming
M Andries, G Engels, A Habel, B Hoffmann, HJ Kreowski, S Kuske, ...
Science of Computer programming 34 (1), 1-54, 1999
2701999
Term graph rewriting
D Plump
Handbook of Graph Grammars and Computing by Graph Transformation 2, 3-61, 1999
2171999
Hierarchical graph transformation
F Drewes, B Hoffmann, D Plump
Journal of Computer and System Sciences 64 (2), 249-283, 2002
1712002
Double-pushout graph transformation revisited
A Habel, J Müller, D Plump
Mathematical Structures in Computer Science 11 (5), 637-688, 2001
1392001
Hypergraph rewriting: Critical pairs and undecidability of confluence
D Plump
Term graph rewriting: theory and practice, 201-213, 1993
1331993
Computational completeness of programming languages based on graph transformation
A Habel, D Plump
Foundations of Software Science and Computation Structures (FOSSACS 2001 …, 2001
1102001
Termination of graph rewriting is undecidable
D Plump
Fundamenta Informaticae 33 (2), 201-209, 1998
1101998
Confluence of graph transformation revisited
D Plump
Processes, Terms and Cycles: Steps on the Road to Infinity. Essays Dedicated …, 2005
962005
The graph programming language GP
D Plump
Conference on Algebraic Informatics (CAI 2009), 99-122, 2009
942009
Relabelling in graph transformation
A Habel, D Plump
International Conference on Graph Transformation (ICGT 2002), 135-147, 2002
882002
Jungle evaluation
A Habel, HJ Kreowski, D Plump
Fundamenta Informaticae 15 (1), 37-60, 1991
74*1991
Hoare-style verification of graph programs
CM Poskitt, D Plump
Fundamenta Informaticae 118 (1-2), 135-175, 2012
71*2012
Towards graph programs for graph algorithms
D Plump, S Steinert
International Conference on Graph Transformation (ICGT 2004), 128-143, 2004
672004
Implementing term rewriting by jungle evaluation
B Hoffmann, D Plump
RAIRO Theoretical Informatics and Applications 25 (5), 445-472, 1991
661991
The Design of GP 2
D Plump
Workshop on Reduction Strategies in Rewriting and Programming (WRS2011), 1-16, 2012
612012
Specifying pointer structures by graph reduction
A Bakewell, D Plump, C Runciman
Applications of Graph Transformations with Industrial Relevance (AGTIVE 2003 …, 2004
592004
Evaluation of functional expressions by hypergraph rewriting
D Plump
ThŁse de Doctorat d’UniversitŘ, Universitat Bremen, 1993
521993
Jungle evaluation for efficient term rewriting
B Hoffmann, D Plump
Algebraic and Logic Programming, 191-203, 1988
521988
Generation of Sierpinski triangles: A case study for graph transformation tools
G Taentzer, E Biermann, D Bisztray, B Bohnet, I Boneva, A Boronat, ...
Applications of Graph Transformations with Industrial Relevance (AGTIVE 2007 …, 2008
452008
On termination of graph rewriting
D Plump
Graph-Theoretic Concepts in Computer Science (WG '95), 88-100, 1995
431995
The system can't perform the operation now. Try again later.
Articles 1–20