45 citations · 137 across the 23 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.PL2022
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…
cs.LO2022★ 3 cited
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…