Equality Saturation Theory Exploration à la Carte

Abstract

Rewrite rules are critical in equality saturation, an increasingly popular technique in optimizing compilers, synthesizers, and verifiers. Unfortunately, developing high-quality rulesets is difficult and error-prone. Recent work on automatically inferring rewrite rules does not scale to large terms or grammars, and existing rule inference tools are monolithic and opaque. Equality saturation users therefore struggle to guide inference and incrementally construct rulesets. As a result, most users still manually develop and maintain rulesets.

Document Details

Document Type
Pub Defense Publication
Publication Date
Oct 16, 2023
Source ID
10.1145/3622834

Entities

People

  • A. Pal
  • Amy Zhu
  • Brett Saiki
  • Chandrakana Nandi
  • Cynthia Richey
  • Max Willsey
  • Oliver Flatt
  • Ryan Tjoa
  • Zachary Tatlock

Organizations

  • Defense Advanced Research Projects Agency
  • National Science Foundation
  • University of Washington

Tags

Fields of Study

  • Computer science

Readers

  • Astronomy/Astrophysics
  • Computational Linguistics
  • Systems Analysis and Design

Technology Areas

  • AI & ML