Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Detlef Plump"'
Autor:
Detlef Plump
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 225, Iss Proc. TERMGRAPH 2016, Pp 35-44 (2016)
GP 2 is a non-deterministic programming language for computing by graph transformation. One of the design goals for GP 2 is syntactic and semantic simplicity, to facilitate formal reasoning about programs. In this paper, we demonstrate with four case
Externí odkaz:
https://doaj.org/article/3b91df36a4d94a7bbd12b5eb33376333
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 181, Iss Proc. GaM 2015, Pp 48-64 (2015)
GP 2 is an experimental programming language for computing by graph transformation. An initial interpreter for GP 2, written in the functional language Haskell, provides a concise and simply structured reference implementation. Despite its simplicity
Externí odkaz:
https://doaj.org/article/8f923045c52046699ef4b3f518e25be8
Autor:
Detlef Plump
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 82, Iss Proc. WRS 2011, Pp 1-16 (2012)
This papers defines the syntax and semantics of GP 2, a revised version of the graph programming language GP. New concepts are illustrated and explained with example programs. Changes to the first version of GP include an improved type system for lab
Externí odkaz:
https://doaj.org/article/8d7c87cab01a47b4b4e5c4f676adff2c
Autor:
Detlef Plump, Sandra Steinert
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 21, Iss Proc. RULE 2009, Pp 27-38 (2010)
GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-
Externí odkaz:
https://doaj.org/article/f6905cd2448c4dcf86fe0103795e7f25
Autor:
Detlef Plump, Graham Campbell
Publikováno v:
Theoretical Computer Science. 884:1-22
The transformation of graphs and graph-like structures is ubiquitous in computer science. When a system is described by graph-transformation rules, it is often desirable that the rules are both terminating and confluent so that rule applications in a
Autor:
Christopher M. Poskitt, Detlef Plump
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 130:100825
Autor:
Detlef Plump, Gia Septiana Wulandari
Publikováno v:
GCM@STAF
We consider Hoare-style verification for the graph programming language GP 2. In previous work, graph properties were specified by so-called E-conditions which extend nested graph conditions. However, this type of assertions is not easy to comprehend
Autor:
Brian Courtehoute, Detlef Plump
We present a computation model based on a subclass of GP 2 graph programs which can simulate any off-line Turing machine of space complexity O(s(n) log s(n)) in space O(s(n)). The simulation only requires a quadratic time overhead. Our model shares t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1707057e5d9282510da9bcd1fade8fd6
Publikováno v:
Genetic Programming and Evolvable Machines. 21:321-347
We introduce a form of neutral horizontal gene transfer (HGT) to evolving graphs by graph programming (EGGP). We introduce the$$\mu \times \lambda$$μ×λevolutionary algorithm (EA), where$$\mu$$μparents each produce$$\lambda$$λchildren who compete
We introduce the concept of Semantic Neutral Drift (SND) for genetic programming (GP), where we exploit equivalence laws to design semantics preserving mutations guaranteed to preserve individuals’ fitness scores. A number of digital circuit benchm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3599ea4f5743023f10d7660b9d86501b
https://eprints.whiterose.ac.uk/154735/1/Atkinson2019_Article_EvolvingGraphsWithSemanticNeut.pdf
https://eprints.whiterose.ac.uk/154735/1/Atkinson2019_Article_EvolvingGraphsWithSemanticNeut.pdf