1 citations · 2 across the 4 of their papers we have counts for
5 papers
Efficient Extraction for Effectful E-Graphs
Oliver Flatt, Anjali Pal, Yihong Zhang +7
Egraphs have enabled recent advances in program optimization, synthesis, and verification, yet remain difficult to apply to effectful programs whose memory and I/O operations must…
Functional Reasoning for Distributed Systems with Failures
Haobin Ni, Robbert van Renesse, Greg Morrisett
Distributed system theory literature often argues for correctness using an informal, Hoare-like style of reasoning. While these arguments are intuitive, they have not all been fool…
Ordered Consensus with Equal Opportunity
Yunhao Zhang, Haobin Ni, Soumya Basu +6
The specification of state machine replication (SMR) has no requirement on the final total order of commands. In blockchains based on SMR, however, order matters, since different o…
Scaling Program Synthesis Based Technology Mapping with Equality Saturation
Gus Henry Smith, Colin Knizek, Daniel Petrisko +5
State-of-the-art hardware compilers for FPGAs often fail to find efficient mappings of high-level designs to low-level primitives, especially complex programmable primitives like d…
E-Graphs as Circuits, and Optimal Extraction via Treewidth
Glenn Sun, Yihong Zhang, Haobin Ni
We demonstrate a new connection between e-graphs and Boolean circuits. This allows us to adapt existing literature on circuits to easily arrive at an algorithm for optimal e-graph…