397 citations · 492 across the 15 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2026
Practical Formal Verification for MLIR Programs
Emily Tucker, Louis-Noël Pouchet, Erika Hunhoff +2
Optimizing compilers have become a cornerstone for high-performance program generation in research and industry. Optimizations, including those implemented manually by a user and t…
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…