Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Plump, Detlef - Department of Computer Science, University of York
Graph Transformation in Constant Time Mike Dodds and Detlef Plump
Double-Pushout Approach with Injective Matching
Checking the Shape Safety of Pointer Manipulations
Evaluation of Functional Expressions by Hypergraph Rewriting
The Graph Programming Language GP Detlef Plump
Electronic Communications of the EASST Volume 10 (2008)
Towards Graph Programs for Graph Algorithms Detlef Plump and Sandra Steinert
A Hoare Calculus for Graph Programs Christopher M. Poskitt and Detlef Plump
Electronic Communications of the EASST Volume 16 (2009)
I. Mackie and A. Martins Moreira (Eds.): Tenth International Workshop on Rule-Based Programming (RULE 2009)
Relabelling in Graph Transformation Annegret Habel1
The York Abstract Machine Greg Manning1
Graph Transformation for Specification and Programming \Lambda
Fundamenta Informaticae 33(2), 1998, 201--209 1 Termination of graph rewriting is undecidable \Lambda
Information and Computation 156, 224 (2000) Bisimilarity in Term Graph Rewriting1
Specifying Pointer Structures by Graph Reduction
Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools
Complete Strategies for Term Graph Narrowing Annegret Habel1
Hypergraph Rewriting: Critical Pairs and
Hoare Logic for Graph Programs Christopher M. Poskitt and Detlef Plump
Graph Programs Detlef Plump
Extending C for Checking Shape Safety Mike Dodds1
Diagrams for Meaning Preservation Joe B. Wells1
Computational Completeness of Programming Languages Based on Graph Transformation
Electronic Communications of the EASST Volume 26 (2010)
Confluence of Graph Transformation Revisited Detlef Plump
0022-0000/02 $35.00 2002 Elsevier Science (USA)
Math. Struct. in Comp. Science (2001), vol. 11, pp. 637688. c 2001 Cambridge University Press DOI: 10.17/S0960129501003425 Printed in the United Kingdom
Math. Struct. in Comp. Science (1996), vol. 6, pp. 649{676 Copyright c Cambridge University Press Term Graph Narrowing
Specifying Pointer Structures by Graph Reduction
Electronic Communications of the EASST Volume 39 (2011)
Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools
Fundamenta Informaticae 116 (2012) 141 1 DOI 10.3233/FI-2012-600
