default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDetlef Plump
Person information
- affiliation: University of York, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Robert Söldner, Detlef Plump:
Formalising the Double-Pushout Approach to Graph Transformation. Log. Methods Comput. Sci. 20(4) (2024)- [c57]Ziad Ismaili Alaoui, Detlef Plump:
Linear-Time Graph Programs for Unbounded-Degree Graphs. ICGT 2024: 3-20 - 2023
- [j26]Christopher M. Poskitt
, Detlef Plump:
Monadic second-order incorrectness logic for GP 2. J. Log. Algebraic Methods Program. 130: 100825 (2023) - [c56]Robert Söldner, Detlef Plump:
Mechanised DPO Theory: Uniqueness of Derivations and Church-Rosser Theorem. ICGT 2023: 123-142 - [i10]Robert Söldner, Detlef Plump:
Formalising the Double-Pushout Approach to Graph Transformation. CoRR abs/2312.15641 (2023) - 2022
- [j25]Graham Campbell, Brian Courtehoute, Detlef Plump:
Fast rule-based graph programs. Sci. Comput. Program. 214: 102727 (2022) - [c55]Brian Courtehoute, Detlef Plump:
Time and Space Measures for a Complete Graph Computation Model. GCM@STAF 2022: 23-44 - [c54]Robert Söldner, Detlef Plump:
Towards Mechanised Proofs in Double-Pushout Graph Transformation. GCM@STAF 2022: 59-75 - 2021
- [j24]Timothy Atkinson, Detlef Plump, Susan Stepney:
Evolving graphs with semantic neutral drift. Nat. Comput. 20(1): 127-143 (2021) - [j23]Graham Campbell, Detlef Plump:
Confluence up to garbage in graph transformation. Theor. Comput. Sci. 884: 1-22 (2021) - [c53]Gia Septiana Wulandari, Detlef Plump:
Verifying Graph Programs with Monadic Second-Order Logic. ICGT 2021: 240-261 - [c52]Brian Courtehoute, Detlef Plump:
A Small-Step Operational Semantics for GP 2. GCM@STAF 2021: 89-110 - [i9]Graham Campbell, Detlef Plump:
Confluence up to Garbage in Graph Transformation. CoRR abs/2101.01842 (2021) - 2020
- [j22]Timothy Atkinson, Detlef Plump, Susan Stepney:
Horizontal gene transfer for recombining graphs. Genet. Program. Evolvable Mach. 21(3): 321-347 (2020) - [c51]Graham Campbell, Detlef Plump:
Confluence up to Garbage. ICGT 2020: 20-37 - [c50]Brian Courtehoute, Detlef Plump:
A Fast Graph Program for Computing Minimum Spanning Trees. GCM@STAF 2020: 163-180 - [c49]Gia Septiana Wulandari, Detlef Plump:
Verifying Graph Programs with First-Order Logic. GCM@STAF 2020: 181-200 - [i8]Graham Campbell, Jack Romo, Detlef Plump:
Improving the GP 2 Compiler. CoRR abs/2002.02914 (2020) - [i7]Graham Campbell, Jack Romo, Detlef Plump:
The Improved GP 2 Compiler. CoRR abs/2010.03993 (2020) - [i6]Gia Septiana Wulandari, Detlef Plump:
Verifying Graph Programs with First-Order Logic (Extended Version). CoRR abs/2010.14549 (2020) - [i5]Graham Campbell, Brian Courtehoute, Detlef Plump:
Fast Rule-Based Graph Programs. CoRR abs/2012.11394 (2020)
2010 – 2019
- 2019
- [j21]Detlef Plump, Juan de Lara:
Preface to the special issue on the 10th International Conference on Graph Transformation. J. Log. Algebraic Methods Program. 104: 174-175 (2019) - [c48]Graham Campbell, Brian Courtehoute, Detlef Plump:
Linear-Time Graph Algorithms in GP 2. CALCO 2019: 16:1-16:23 - [c47]Timothy Atkinson, Detlef Plump, Susan Stepney:
Evolving graphs with horizontal gene transfer. GECCO 2019: 968-976 - [e6]Rachid Echahed, Detlef Plump:
Proceedings Tenth International Workshop on Graph Computation Models, GCM@STAF 2019, Eindhoven, The Netherlands, 17th July 2019. EPTCS 309, 2019 [contents] - [i4]Graham Campbell, Detlef Plump:
Efficient Recognition of Graph Languages. CoRR abs/1911.12884 (2019) - 2018
- [c46]Detlef Plump:
Modular Termination of Graph Transformation. Graph Transformation, Specifications, and Nets 2018: 231-244 - [c45]Timothy Atkinson, Detlef Plump, Susan Stepney:
Evolving Graphs by Graph Programming. EuroGP 2018: 35-51 - [c44]Timothy Atkinson, Detlef Plump, Susan Stepney:
Probabilistic Graph Programs for Randomised and Evolutionary Algorithms. ICGT 2018: 63-78 - [c43]Gia Septiana Wulandari, Detlef Plump:
Verifying a Copying Garbage Collector in GP 2. STAF Workshops 2018: 479-494 - [i3]Timothy Atkinson, Detlef Plump, Susan Stepney:
Semantic Neutral Drift. CoRR abs/1810.10453 (2018) - 2017
- [j20]Detlef Plump:
From imperative to rule-based graph programs. J. Log. Algebraic Methods Program. 88: 154-173 (2017) - [c42]Ivaylo Hristakiev, Detlef Plump:
Checking Graph Programs for Confluence. STAF Workshops 2017: 92-108 - [e5]Juan de Lara, Detlef Plump:
Graph Transformation - 10th International Conference, ICGT 2017, Held as Part of STAF 2017, Marburg, Germany, July 18-19, 2017, Proceedings. Lecture Notes in Computer Science 10373, Springer 2017, ISBN 978-3-319-61469-4 [contents] - [i2]Ivaylo Hristakiev, Detlef Plump:
A Unification Algorithm for GP 2 (Long Version). CoRR abs/1705.02171 (2017) - 2016
- [c41]Christopher Bak, Detlef Plump:
Compiling Graph Programs to C. ICGT 2016: 102-117 - [c40]Ivaylo Hristakiev, Detlef Plump:
Attributed Graph Transformation via Rule Schemata: Church-Rosser Theorem. STAF Workshops 2016: 145-160 - [c39]Ivaylo Hristakiev, Detlef Plump:
Towards Critical Pair Analysis for the Graph Programming Language GP 2. WADT 2016: 153-169 - [c38]Detlef Plump:
Reasoning about Graph Programs. TERMGRAPH 2016: 35-44 - 2015
- [j19]Detlef Plump:
Preface. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 73 (2015) - [c37]Christopher Bak, Glyn Faulkner, Detlef Plump, Colin Runciman:
A Reference Interpreter for the Graph Programming Language GP 2. GaM 2015: 48-64 - [e4]Detlef Plump:
Proceedings of the 6th International Workshop on Graph Computation Models co-located with the 8th International Conference on Graph Transformation (ICGT 2015) part of the Software Technologies: Applications and Foundations (STAF 2015) federation of conferences, L'Aquila, Italy, July 20, 2015. CEUR Workshop Proceedings 1403, CEUR-WS.org 2015 [contents] - 2014
- [j18]Ivaylo Hristakiev, Detlef Plump:
A Unification Algorithm for GP 2. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 71 (2014) - [c36]Christopher M. Poskitt, Detlef Plump:
Verifying Monadic Second-Order Properties of Graph Programs. ICGT 2014: 33-48 - [i1]Christopher M. Poskitt, Detlef Plump:
Verifying Monadic Second-Order Properties of Graph Programs. CoRR abs/1405.5927 (2014) - 2013
- [j17]Christopher M. Poskitt, Detlef Plump:
Verifying Total Correctness of Graph Programs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 61 (2013) - [e3]Rachid Echahed, Detlef Plump:
Proceedings 7th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2013, Rome, Italy, 23th March 2013. EPTCS 110, 2013 [contents] - 2012
- [j16]Detlef Plump, Christopher Bak:
Rooted Graph Programs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 54 (2012) - [j15]Christopher M. Poskitt, Detlef Plump:
Hoare-Style Verification of Graph Programs. Fundam. Informaticae 118(1-2): 135-175 (2012) - [c35]Annegret Habel, Detlef Plump:
$\mathcal M, \mathcal N$ -Adhesive Transformation Systems. ICGT 2012: 218-233 - 2011
- [j14]Detlef Plump, Robin Suri, Ambuj Singh:
Minimizing Finite Automata with Graph Programs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 39 (2011) - [c34]Detlef Plump:
The Design of GP 2. WRS 2011: 1-16 - 2010
- [j13]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. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [j12]Detlef Plump:
Checking Graph-Transformation Systems for Confluence. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [c33]Christopher M. Poskitt, Detlef Plump:
A Hoare Calculus for Graph Programs. ICGT 2010: 139-154
2000 – 2009
- 2009
- [c32]Detlef Plump:
The Graph Programming Language GP. CAI 2009: 99-122 - [c31]Detlef Plump, Sandra Steinert:
The Semantics of Graph Programs. RULE 2009: 27-38 - 2008
- [j11]Greg Manning, Detlef Plump:
The GP Programming System. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 10 (2008) - [j10]Mike Dodds, Detlef Plump:
From Hyperedge Replacement to Separation Logic and Back. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 16 (2008) - [e2]Ian Mackie, Detlef Plump:
Proceedings of the Fourth International Workshop on Computing with Terms and Graphs, TERMGRAPH@ETAPS 2007, Braga, Portugal, March 31, 2007. Electronic Notes in Theoretical Computer Science 203(1), Elsevier 2008 [contents] - 2007
- [j9]Ian Mackie, Detlef Plump:
Theory and applications of term graph rewriting: introduction. Math. Struct. Comput. Sci. 17(3): 361-362 (2007) - [c30]Gabriele Taentzer, Enrico Biermann, Dénes Bisztray, Bernd Bohnet, Iovka Boneva, Artur Boronat, Leif Geiger, Rubino Geiß, Ákos Horváth, 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 - [c29]Ian Mackie, Detlef Plump:
Preface. TERMGRAPH@ETAPS 2007: 1-2 - [e1]Ian Mackie, Detlef Plump:
Proceedings of the First International Workshop on Term Graph Rewriting, TERMGRAPH 2002, Barcelona, Spain, October 7, 2002. Electronic Notes in Theoretical Computer Science 72(1), Elsevier 2007 [contents] - 2006
- [c28]Mike Dodds, Detlef Plump:
Graph Transformation in Constant Time. ICGT 2006: 367-382 - [c27]Greg Manning, Detlef Plump:
The York Abstract Machine. GT-VMT@ETAPS 2006: 231-240 - 2005
- [c26]Detlef Plump:
Confluence of Graph Transformation Revisited. Processes, Terms and Cycles 2005: 280-308 - [c25]Mike Dodds, Detlef Plump:
Extending C for Checking Shape Safety. GT-VC@CONCUR 2005: 95-112 - 2004
- [c24]Detlef Plump, Sandra Steinert:
Towards Graph Programs for Graph Algorithms. ICGT 2004: 128-143 - 2003
- [c23]Adam Bakewell, Detlef Plump, Colin Runciman:
Checking the Shape Safety of Pointer Manipulations. RelMiCS 2003: 48-61 - [c22]Adam Bakewell, Detlef Plump, Colin Runciman:
Specifying Pointer Structures by Graph Reduction. AGTIVE 2003: 30-44 - [c21]J. B. Wells, Detlef Plump, Fairouz Kamareddine:
Diagrams for Meaning Preservation. RTA 2003: 88-106 - 2002
- [j8]Frank Drewes, Berthold Hoffmann, Detlef Plump:
Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64(2): 249-283 (2002) - [c20]Annegret Habel, Detlef Plump:
Relabelling in Graph Transformation. ICGT 2002: 135-147 - [c19]Detlef Plump:
TERMGRAPH 2002 - Workshop Survey. ICGT 2002: 435-439 - [c18]Ian Mackie, Detlef Plump:
Preface. TERMGRAPH 2002: 1-2 - 2001
- [j7]Annegret Habel, Jürgen Müller, Detlef Plump:
Double-pushout graph transformation revisited. Math. Struct. Comput. Sci. 11(5): 637-688 (2001) - [c17]Annegret Habel, Detlef Plump:
Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245 - [c16]Annegret Habel, Detlef Plump:
Solving Equations by Graph Transformation. GETGRATS Closing Workshop 2001: 165-176 - [c15]Detlef Plump:
Essentials of Term Graph Rewriting. GETGRATS Closing Workshop 2001: 277-289 - 2000
- [j6]Zena M. Ariola, Jan Willem Klop, Detlef Plump:
Bisimilarity in Term Graph Rewriting. Inf. Comput. 156(1-2): 2-24 (2000) - [c14]Frank Drewes, Berthold Hoffmann, Detlef Plump:
Hierarchical Graph Transformation. FoSSaCS 2000: 98-113
1990 – 1999
- 1999
- [j5]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
- [j4]Detlef Plump:
Termination of Graph Rewriting is Undecidable. Fundam. Informaticae 33(2): 201-209 (1998) - [c13]Annegret Habel, Jürgen Müller, Detlef Plump:
Double-Pushout Approach with Injective Matching. TAGT 1998: 103-116 - [c12]Annegret Habel, Detlef Plump:
Complete Strategies for Term Graph Narrowing. WADT 1998: 152-167 - 1997
- [c11]Detlef Plump:
Simplification Orders for Term Graph Rewriting. MFCS 1997: 458-467 - [c10]Zena M. Ariola, Jan Willem Klop, Detlef Plump:
Confluent rewriting of bisimilar term graphs. EXPRESS 1997: 19 - 1996
- [j3]Annegret Habel, Detlef Plump:
Term Graph Narrowing. Math. Struct. Comput. Sci. 6(6): 649-676 (1996) - 1995
- [c9]Detlef Plump:
On Termination of Graph Rewriting. WG 1995: 88-100 - [c8]Annegret Habel, Detlef Plump:
Unification, rewriting, and narrowing on term graphs. SEGRAGRA 1995: 110-117 - 1994
- [c7]Detlef Plump:
Critical Pairs in Term Graph Rewriting. MFCS 1994: 556-566 - [c6]Detlef Plump, Annegret Habel:
Graph Unification and Matching. TAGT 1994: 75-88 - 1993
- [b1]Detlef Plump:
Evaluation of functional expressions by hypergraph rewriting. University of Bremen, Germany, 1993, pp. I-VI, 1-119 - 1992
- [c5]Detlef Plump:
Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. CTRS 1992: 97-112 - 1991
- [j2]Annegret Habel, Hans-Jörg Kreowski, Detlef Plump:
Jungle evaluation. Fundam. Informaticae 15(1): 37-60 (1991) - [j1]Berthold Hoffmann, Detlef Plump:
Implementing term rewriting by jungle evaluation. RAIRO Theor. Informatics Appl. 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]Berthold Hoffmann, Detlef Plump:
Jungle Evaluation for Efficient Term Rewriting. ALP 1988: 191-203 - 1987
- [c1]Annegret Habel, Hans-Jörg Kreowski, Detlef Plump:
Jungle Evaluation. ADT 1987: 92-112
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
