1 citations · 1 across the 1 of their papers we have counts for
1 paper
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…