4 citations · 5 across the 2 of their papers we have counts for
1 paper · 1 filter
Steve Kommrusch, Théo Barollet, Louis-Noël Pouchet
In this work we target the problem of provably computing the equivalence between two programs represented as dataflow graphs. To this end, we formalize the problem of equivalence b…