Zobrazeno 1 - 10
of 645
pro vyhledávání: '"Plump A"'
Autor:
Vastarini, Federico, Plump, Detlef
Publikováno v:
EPTCS 408, 2024, pp. 107-120
We present a method for generating random hypergraphs in context-free hypergraph languages. It is obtained by adapting Mairson's generation algorithm for context-free string grammars to the setting of hyperedge replacement grammars. Our main results
Externí odkaz:
http://arxiv.org/abs/2410.00541
As AI solutions enter safety-critical products, the explainability and interpretability of solutions generated by AI products become increasingly important. In the long term, such explanations are the key to gaining users' acceptance of AI-based syst
Externí odkaz:
http://arxiv.org/abs/2408.16780
Autor:
Söldner, Robert, Plump, Detlef
In this paper, we utilize Isabelle/HOL to develop a formal framework for the basic theory of double-pushout graph transformation. Our work includes defining essential concepts like graphs, morphisms, pushouts, and pullbacks, and demonstrating their p
Externí odkaz:
http://arxiv.org/abs/2312.15641
Autor:
Courtehoute, Brian, Plump, Detlef
Publikováno v:
EPTCS 374, 2022, pp. 23-44
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:
http://arxiv.org/abs/2212.11637
Autor:
Söldner, Robert, Plump, Detlef
Publikováno v:
EPTCS 374, 2022, pp. 59-75
We formalise the basics of the double-pushout approach to graph transformation in the proof assistant Isabelle/HOL and provide associated machine-checked proofs. Specifically, we formalise graphs, graph morphisms and rules, and a definition of direct
Externí odkaz:
http://arxiv.org/abs/2212.11630
Autor:
Courtehoute, Brian, Plump, Detlef
Publikováno v:
EPTCS 350, 2021, pp. 89-110
The operational semantics of a programming language is said to be small-step if each transition step is an atomic computation step in the language. A semantics with this property faithfully corresponds to the implementation of the language. The previ
Externí odkaz:
http://arxiv.org/abs/2112.11077
Autor:
Campbell, Graham, Plump, Detlef
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
Externí odkaz:
http://arxiv.org/abs/2101.01842
Implementing graph algorithms efficiently in a rule-based language is challenging because graph pattern matching is expensive. In this paper, we present a number of linear-time implementations of graph algorithms in GP 2, an experimental programming
Externí odkaz:
http://arxiv.org/abs/2012.11394
Autor:
Wulandari, Gia S., Plump, Detlef
Publikováno v:
EPTCS 330, 2020, pp. 181-200
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
Externí odkaz:
http://arxiv.org/abs/2012.01662
Autor:
Courtehoute, Brian, Plump, Detlef
Publikováno v:
EPTCS 330, 2020, pp. 163-180
When using graph transformation rules to implement graph algorithms, a challenge is to match the efficiency of programs in conventional languages. To help overcome that challenge, the graph programming language GP 2 features rooted rules which, under
Externí odkaz:
http://arxiv.org/abs/2012.02193