4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.PL2021★ 1 cited
Proving Equivalence Between Complex Expressions Using Graph-to-Sequence Neural Models
Steve Kommrusch, Théo Barollet, Louis-Noël Pouchet
We target the problem of provably computing the equivalence between two complex expression trees. To this end, we formalize the problem of equivalence between two such programs as…
cs.LG2020★ 4 cited
Equivalence of Dataflow Graphs via Rewrite Rules Using a Graph-to-Sequence Neural Model
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…