
Briggs, Ian

EGRAPHS '22: "Synthesizing Mathematical ..."
Synthesizing Mathematical Identities with Egraphs
Ian Briggs and Pavel Panchekha
(University of Utah, USA)
Identities compactly describe properties of a mathematical expression and can be leveraged into faster and more accurate function implementations. However, identities must currently be discovered manually, which requires a lot of expertise. We propose a twophase synthesis and deduplication pipeline that discovers these identities automatically. In the synthesis step, a set of rewrite rules is composed, using an egraph, to discover candidate identities. However, most of these candidates are duplicates, which a secondary deduplication step discards using integer linear programming and another egraph. Applied to a set of 61 benchmarks, the synthesis phase generates 7215 candidate identities which the deduplication phase then reduces down to 125 core identities.
Article Search


Panchekha, Pavel

EGRAPHS '22: "Synthesizing Mathematical ..."
Synthesizing Mathematical Identities with Egraphs
Ian Briggs and Pavel Panchekha
(University of Utah, USA)
Identities compactly describe properties of a mathematical expression and can be leveraged into faster and more accurate function implementations. However, identities must currently be discovered manually, which requires a lot of expertise. We propose a twophase synthesis and deduplication pipeline that discovers these identities automatically. In the synthesis step, a set of rewrite rules is composed, using an egraph, to discover candidate identities. However, most of these candidates are duplicates, which a secondary deduplication step discards using integer linear programming and another egraph. Applied to a set of 61 benchmarks, the synthesis phase generates 7215 candidate identities which the deduplication phase then reduces down to 125 core identities.
Article Search
