257 citations · 483 across the 39 of their papers we have counts for
5 papers · 1 filter
Combining E-Graphs with Abstract Interpretation
Samuel Coward, George A. Constantinides, Theo Drane
E-graphs are a data structure that compactly represents equivalent expressions. They are constructed via the repeated application of rewrite rules. Often in practical applications,…
Automatic Datapath Optimization using E-Graphs
Samuel Coward, George A. Constantinides, Theo Drane
Manual optimization of Register Transfer Level (RTL) datapath is commonplace in industry but holds back development as it can be very time consuming. We utilize the fact that a com…
Abstract Interpretation on E-Graphs
Samuel Coward, George A. Constantinides, Theo Drane
Recent e-graph applications have typically considered concrete semantics of expressions, where the notion of equivalence stems from concrete interpretation of expressions. However,…
High-level Synthesis using the Julia Language
Benjamin Biggs, Ian McInerney, Eric C. Kerrigan +1
The growing proliferation of FPGAs and High-level Synthesis (HLS) tools has led to a large interest in designing hardware accelerators for complex operations and algorithms. Howeve…
Logic Shrinkage: Learned FPGA Netlist Sparsity for Efficient Neural Network Inference
Erwei Wang, James J. Davis, Georgios-Ilias Stavrou +3
FPGA-specific DNN architectures using the native LUTs as independently trainable inference operators have been shown to achieve favorable area-accuracy and energy-accuracy tradeoff…