45 citations · 137 across the 23 of their papers we have counts for
24 papers
Implementing Binary Search Trees in GP 2 (Extended Abstract)
Ziad Ismaili Alaoui, Detlef Plump
We present an approach to implement binary search trees in the rule-based graph programming language GP 2. Our implementation uses GP 2's rooted graph transformation rules to be fa…
Linear-Time Graph Programs without Preconditions
Ziad Ismaili Alaoui, Detlef Plump
We report on a recent breakthrough in rule-based graph programming, which allows us to reach the time complexity of imperative linear-time algorithms. In general, achieving the com…
Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
Ziad Ismaili Alaoui, Detlef Plump
We report on recent advances in rule-based graph programming, which allow us to match the time complexity of some fundamental imperative graph algorithms. In general, achieving the…
Random Graph Generation in Context-Free Graph Languages
Federico Vastarini, Detlef Plump
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 gramma…
Time and Space Measures for a Complete Graph Computation Model
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…
Towards Mechanised Proofs in Double-Pushout Graph Transformation
Robert Söldner, Detlef Plump
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 f…