397 citations · 594 across the 8 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2021★ 10 cited
Self-Supervised Learning to Prove Equivalence Between Straight-Line Programs via Rewrite Rules
Steve Kommrusch, Martin Monperrus, Louis-Noël Pouchet
We target the problem of automatically synthesizing proofs of semantic equivalence between two programs made of sequences of statements. We represent programs using abstract syntax…
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…