{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:45:45Z","timestamp":1776955545230,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,27]]},"DOI":"10.1145\/3620665.3640392","type":"proceedings-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T14:18:06Z","timestamp":1713795486000},"page":"1029-1044","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["SEER: Super-Optimization Explorer for High-Level Synthesis using E-graph Rewriting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2791-2555","authenticated-orcid":false,"given":"Jianyi","family":"Cheng","sequence":"first","affiliation":[{"name":"Intel Corporation, London, United Kingdom"},{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7741-3271","authenticated-orcid":false,"given":"Samuel","family":"Coward","sequence":"additional","affiliation":[{"name":"Intel Corporation, London, United Kingdom"},{"name":"Imperial College London, London, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8539-2397","authenticated-orcid":false,"given":"Lorenzo","family":"Chelini","sequence":"additional","affiliation":[{"name":"Intel Corporation, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5106-9161","authenticated-orcid":false,"given":"Rafael","family":"Barbalho","sequence":"additional","affiliation":[{"name":"Intel Corporation, Folsom, California, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6488-5440","authenticated-orcid":false,"given":"Theo","family":"Drane","sequence":"additional","affiliation":[{"name":"Intel Corporation, Folsom, California, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,4,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3528416.3530866"},{"key":"e_1_3_2_1_2_1","volume-title":"Micomp: Mitigating the compiler phase-ordering problem using optimization sub-sequences and machine learning. ACM Transactions on Architecture and Code Optimization (TACO), 14(3):1--28","author":"Ashouri Amir H","year":"2017","unstructured":"Amir H Ashouri, Andrea Bignoli, Gianluca Palermo, Cristina Silvano, Sameer Kulkarni, and John Cavazos. Micomp: Mitigating the compiler phase-ordering problem using optimization sub-sequences and machine learning. ACM Transactions on Architecture and Code Optimization (TACO), 14(3):1--28, 2017."},{"key":"e_1_3_2_1_3_1","volume-title":"A survey on compiler autotuning using machine learning. ACM Computing Surveys (CSUR), 51(5):1--42","author":"Ashouri Amir H","year":"2018","unstructured":"Amir H Ashouri, William Killian, John Cavazos, Gianluca Palermo, and Cristina Silvano. A survey on compiler autotuning using machine learning. ACM Computing Surveys (CSUR), 51(5):1--42, 2018."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2014.6927490"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2014.7478841"},{"key":"e_1_3_2_1_6_1","unstructured":"Catapult High-Level Synthesis 2023."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0070369"},{"key":"e_1_3_2_1_8_1","unstructured":"Circuit IR Compilers and Tools 2023."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH54963.2022.00016"},{"key":"e_1_3_2_1_11_1","volume-title":"Automating constraint-aware datapath optimization using e-graphs. arXiv preprint arXiv:2303.01839","author":"Coward Samuel","year":"2023","unstructured":"Samuel Coward, George A Constantinides, and Theo Drane. Automating constraint-aware datapath optimization using e-graphs. arXiv preprint arXiv:2303.01839, 2023."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589250.3596144"},{"key":"e_1_3_2_1_13_1","volume-title":"Datapath verification via word-level e-graph rewriting. arXiv preprint arXiv:2308.00431","author":"Coward Samuel","year":"2023","unstructured":"Samuel Coward, Emiliano Morini, Bryan Tan, Theo Drane, and George Constantinides. Datapath verification via word-level e-graph rewriting. arXiv preprint arXiv:2308.00431, 2023."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735688.1735702"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_13"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","volume-title":"Z3: An efficient SMT Solver","author":"Moura Leonardo De","year":"2008","unstructured":"Leonardo De Moura and Nikolaj Bj\u00f8rner. Z3: An efficient SMT Solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 4963 LNCS, 2008."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3012750"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design, FMCAD 2022","author":"Flatt O.","year":"2022","unstructured":"O. Flatt, S. Coward, M. Willsey, Z. Tatlock, and P. Panchekha. Small Proofs from Congruence Closure. In Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design, FMCAD 2022, 2022."},{"key":"e_1_3_2_1_19_1","volume-title":"INFORMS","author":"Forrest John","year":"2005","unstructured":"John Forrest and Robin Lougee-Heimer. Cbc user guide. In Emerging theory, methods, and applications, pages 257--277. INFORMS, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.2012.224"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2019.00049"},{"key":"e_1_3_2_1_22_1","unstructured":"Intel HLS Compiler 2023."},{"key":"e_1_3_2_1_23_1","first-page":"127","volume-title":"Paolo Ienne. Dynamically Scheduled High-level Synthesis. In Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA '18","author":"Josipovi\u0107 Lana","year":"2018","unstructured":"Lana Josipovi\u0107, Radhika Ghosal, and Paolo Ienne. Dynamically Scheduled High-level Synthesis. In Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA '18, pages 127--136, Monterey, CA, 2018. ACM."},{"key":"e_1_3_2_1_24_1","unstructured":"Knuth-Morris-Pratt algorithm 2023."},{"key":"e_1_3_2_1_25_1","volume-title":"Sketch-Guided Equality Saturation: Scaling Equality Saturation to Complex Optimizations of Functional Programs. 11","author":"Koehler Thomas","year":"2021","unstructured":"Thomas Koehler, Phil Trinder, and Michel Steuwer. Sketch-Guided Equality Saturation: Scaling Equality Saturation to Complex Optimizations of Functional Programs. 11 2021."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.860764"},{"key":"e_1_3_2_1_27_1","volume-title":"High level synthesis for retiming stochastic vlsi signal processing architectures. Procedia computer science, 143:10--19","author":"Krishnapriya PN","year":"2018","unstructured":"PN Krishnapriya and B Bala Tripura Sundari. High level synthesis for retiming stochastic vlsi signal processing architectures. Procedia computer science, 143:10--19, 2018."},{"key":"e_1_3_2_1_28_1","volume-title":"Practical exhaustive optimization phase order exploration and evaluation. ACM Transactions on Architecture and Code Optimization (TACO), 6(1):1--36","author":"Kulkarni Prasad A","year":"2009","unstructured":"Prasad A Kulkarni, David B Whalley, Gary S Tyson, and Jack W Davidson. Practical exhaustive optimization phase order exploration and evaluation. ACM Transactions on Architecture and Code Optimization (TACO), 6(1):1--36, 2009."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384628"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289602.3293910"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/106973.106981"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370308"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1980.1653748"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488795"},{"key":"e_1_3_2_1_36_1","unstructured":"MLIR EmitC 2023."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT52795.2021.00011"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485496"},{"key":"e_1_3_2_1_40_1","article-title":"End-to-end automatic logic optimization exploration via domain-specific multi-armed bandit","author":"Neto Walter Lau","year":"2022","unstructured":"Walter Lau Neto, Yingjie Li, Pierre-Emmanuel Gaillardon, and Cunxi Yu. Flowtune: End-to-end automatic logic optimization exploration via domain-specific multi-armed bandit. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980930.2907959"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2813885.2737959"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2014.6983050"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2943570"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460945.3464953"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1098646"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032305.2032364"},{"key":"e_1_3_2_1_48_1","unstructured":"Stratus High-Level Synthesis 2023."},{"key":"e_1_3_2_1_49_1","unstructured":"Synopsys HECTOR 2023."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480915"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM53951.2022.9786123"},{"key":"e_1_3_2_1_52_1","unstructured":"Ecenur Ustun Cunxi Yu and Zhiru Zhang. Equality Saturation for Datapath Synthesis: A Pathway to Pareto Optimality."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446707"},{"key":"e_1_3_2_1_54_1","volume-title":"Proceedings of the VLDB Endowment, 13(11)","author":"Wang Yisu Remy","year":"2020","unstructured":"Yisu Remy Wang, Shana Hutchison, Jonathan Leang, Bill Howe, and Dan Suciu. SPORES: Sum-product optimization via relational equality saturation for large scale linear algebra. Proceedings of the VLDB Endowment, 13(11), 2020."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434304"},{"key":"e_1_3_2_1_56_1","unstructured":"Xilinx Vitis HLS 2023."},{"key":"e_1_3_2_1_57_1","volume-title":"Yun Liang. HECTOR: A MultiLevel Intermediate Representation for Hardware Synthesis Methodologies. In Proceedings of the 41st IEEE\/ACM International Conference on Computer-Aided Design, ICCAD '22","author":"Xu Ruifan","year":"2022","unstructured":"Ruifan Xu, Youwei Xiao, Jin Luo, and Yun Liang. HECTOR: A MultiLevel Intermediate Representation for Hardware Synthesis Methodologies. In Proceedings of the 41st IEEE\/ACM International Conference on Computer-Aided Design, ICCAD '22, New York, NY, USA, 2022. Association for Computing Machinery."},{"key":"e_1_3_2_1_58_1","first-page":"255","article-title":"Equality saturation for tensor graph superoptimization","volume":"3","author":"Yang Yichen","year":"2021","unstructured":"Yichen Yang, Phitchaya Phothilimthana, Yisu Wang, Max Willsey, Sudip Roy, and Jacques Pienaar. Equality saturation for tensor graph superoptimization. Proceedings of Machine Learning and Systems, 3:255--268, 2021.","journal-title":"Proceedings of Machine Learning and Systems"},{"key":"e_1_3_2_1_59_1","first-page":"741","volume-title":"Deming Chen. ScaleHLS: A New Scalable High-Level Synthesis Framework on Multi-Level Intermediate Representation. In 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)","author":"Ye Hanchen","year":"2022","unstructured":"Hanchen Ye, Cong Hao, Jianyi Cheng, Hyunmin Jeong, Jack Huang, Stephen Neuendorffer, and Deming Chen. ScaleHLS: A New Scalable High-Level Synthesis Framework on Multi-Level Intermediate Representation. In 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pages 741--755, 2022."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507748"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2013.6691121"},{"key":"e_1_3_2_1_62_1","first-page":"235","volume-title":"Constantinides. POLSCA: Polyhedral High-Level Synthesis with Compiler Transformations. In 2022 32nd International Conference on Field-Programmable Logic and Applications (FPL)","author":"Zhao Ruizhe","year":"2022","unstructured":"Ruizhe Zhao, Jianyi Cheng, Wayne Luk, and George A. Constantinides. POLSCA: Polyhedral High-Level Synthesis with Compiler Transformations. In 2022 32nd International Conference on Field-Programmable Logic and Applications (FPL), pages 235--242, 2022."}],"event":{"name":"ASPLOS '24: 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2","location":"La Jolla CA USA","acronym":"ASPLOS '24","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGOPS ACM Special Interest Group on Operating Systems","SIGPLAN ACM Special Interest Group on Programming Languages","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3620665.3640392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3620665.3640392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:42Z","timestamp":1750291422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3620665.3640392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,27]]},"references-count":61,"alternative-id":["10.1145\/3620665.3640392","10.1145\/3620665"],"URL":"https:\/\/doi.org\/10.1145\/3620665.3640392","relation":{},"subject":[],"published":{"date-parts":[[2024,4,27]]},"assertion":[{"value":"2024-04-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}