Thesis (Ph.D.)--University of Washington, 2021Programming language tools like compilers, optimizers, verifiers, and synthesizers rely on term rewriting to effectively manipulate programs. While powerful and well-studied, term rewriting traditionally suffers from a critical stumbling block: users must choose when and how to apply the right rewrite, and the quality of the results hinges on this difficult decision. A recent technique called equality saturation mitigates this “rewrite choice” issue by allowing many rewrites to apply simultaneously. Despite its promise, the technique’s applicability has been limited by lack of flexibility and poor scalability. This thesis offers theoretical and practical advances that make equality saturation fa...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Many modern (mobile) systems involve memory intensive computations. External memory accesses are cos...
In the field of robust geometric computation it is often necessary to make exact decisions based on ...
Superoptimization is the idea of creating the most optimal program possible from a given input progr...
Abstract. Optimizations in a traditional compiler are applied sequentially, with each optimization d...
In this dissertation, I describe the Peggy system for performing program optimization and translatio...
This is the accompany artifact of our paper "Better Together: Unifying Datalog and Equality Saturati...
Library learning compresses a given corpus of programs by extracting common structure from the corpu...
This is the artifact for our paper "Rewrite Rule Inference Using Equality Saturation", which will ap...
E-graphs are a data structure that compactly represents equivalent expressions. They are constructed...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
© Springer Nature Switzerland AG 2019. We introduce a fully automatic system, implemented in the Lea...
We show that the familiar explanation-based general-ization (EBG) procedure is applicable to a large...
Numerical hardware design requires aggressive optimization, where designers exploit branch constrain...
Artificially created treebank of elliptical constructions (gapping), in the annotation style of Univ...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Many modern (mobile) systems involve memory intensive computations. External memory accesses are cos...
In the field of robust geometric computation it is often necessary to make exact decisions based on ...
Superoptimization is the idea of creating the most optimal program possible from a given input progr...
Abstract. Optimizations in a traditional compiler are applied sequentially, with each optimization d...
In this dissertation, I describe the Peggy system for performing program optimization and translatio...
This is the accompany artifact of our paper "Better Together: Unifying Datalog and Equality Saturati...
Library learning compresses a given corpus of programs by extracting common structure from the corpu...
This is the artifact for our paper "Rewrite Rule Inference Using Equality Saturation", which will ap...
E-graphs are a data structure that compactly represents equivalent expressions. They are constructed...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
© Springer Nature Switzerland AG 2019. We introduce a fully automatic system, implemented in the Lea...
We show that the familiar explanation-based general-ization (EBG) procedure is applicable to a large...
Numerical hardware design requires aggressive optimization, where designers exploit branch constrain...
Artificially created treebank of elliptical constructions (gapping), in the annotation style of Univ...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Many modern (mobile) systems involve memory intensive computations. External memory accesses are cos...
In the field of robust geometric computation it is often necessary to make exact decisions based on ...