Search Results for author:
Found 2 papers, 0 papers with code
Proving Equivalence Between Complex Expressions Using Graph-to-Sequence Neural Models
We target the problem of provably computing the equivalence between two complex expression trees.
Equivalence of Dataflow Graphs via Rewrite Rules Using a Graph-to-Sequence Neural Model
In this work we target the problem of provably computing the equivalence between two programs represented as dataflow graphs.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
