397 citations · 492 across the 15 of their papers we have counts for
Showing 2021Show 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.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…