Rewrite System Showdown: Stochastic Search vs. EqSat
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917522208456704 |
|---|---|
| author | Hong, Qiantan Soi, Rupanshu Zhang, Yihong Aiken, Alex |
| author_facet | Hong, Qiantan Soi, Rupanshu Zhang, Yihong Aiken, Alex |
| contents | Equality saturation has become a dominant paradigm for equational program optimization. However, it has never been rigorously compared to another approach to the same problem, even though several exist, the most notable being stochastic search. In this paper, we compare equality saturation to stochastic search over five benchmarks to answer the question: are e-graphs actually good? |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_19005 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Rewrite System Showdown: Stochastic Search vs. EqSat Hong, Qiantan Soi, Rupanshu Zhang, Yihong Aiken, Alex Programming Languages Equality saturation has become a dominant paradigm for equational program optimization. However, it has never been rigorously compared to another approach to the same problem, even though several exist, the most notable being stochastic search. In this paper, we compare equality saturation to stochastic search over five benchmarks to answer the question: are e-graphs actually good? |
| title | Rewrite System Showdown: Stochastic Search vs. EqSat |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2605.19005 |