{"id":"https://openalex.org/W4416429716","doi":"https://doi.org/10.1109/iccad66269.2025.11240719","title":"e-boost: Boosted E-Graph Extraction with Adaptive Heuristics and Exact Solving","display_name":"e-boost: Boosted E-Graph Extraction with Adaptive Heuristics and Exact Solving","publication_year":2025,"publication_date":"2025-10-26","ids":{"openalex":"https://openalex.org/W4416429716","doi":"https://doi.org/10.1109/iccad66269.2025.11240719"},"language":null,"primary_location":{"id":"doi:10.1109/iccad66269.2025.11240719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad66269.2025.11240719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101779513","display_name":"Jiaqi Yin","orcid":"https://orcid.org/0009-0006-5845-5333"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jiaqi Yin","raw_affiliation_strings":["University of Maryland,College Park,MD,US"],"affiliations":[{"raw_affiliation_string":"University of Maryland,College Park,MD,US","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037688227","display_name":"Zhan Song","orcid":"https://orcid.org/0000-0003-3585-6522"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhan Song","raw_affiliation_strings":["University of Maryland,College Park,MD,US"],"affiliations":[{"raw_affiliation_string":"University of Maryland,College Park,MD,US","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100418485","display_name":"Chen Chen","orcid":"https://orcid.org/0000-0002-7099-7905"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chen Chen","raw_affiliation_strings":["University of Maryland,College Park,MD,US"],"affiliations":[{"raw_affiliation_string":"University of Maryland,College Park,MD,US","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050643298","display_name":"Yaohui Cai","orcid":"https://orcid.org/0000-0003-3785-3413"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yaohui Cai","raw_affiliation_strings":["Cornell University,Ithaca,NY,US"],"affiliations":[{"raw_affiliation_string":"Cornell University,Ithaca,NY,US","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5115595292","display_name":"Zhiru Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhiru Zhang","raw_affiliation_strings":["Cornell University,Ithaca,NY,US"],"affiliations":[{"raw_affiliation_string":"Cornell University,Ithaca,NY,US","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029321729","display_name":"Cunxi Yu","orcid":"https://orcid.org/0000-0003-3481-307X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cunxi Yu","raw_affiliation_strings":["University of Maryland,College Park,MD,US"],"affiliations":[{"raw_affiliation_string":"University of Maryland,College Park,MD,US","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5101779513"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38355032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.423799991607666,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.423799991607666,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.3012999892234802,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.12919999659061432,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7092999815940857},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6876999735832214},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6819999814033508},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5871999859809875},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5846999883651733},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5781999826431274},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4535999894142151},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.34769999980926514}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7281000018119812},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7092999815940857},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6876999735832214},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6819999814033508},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5871999859809875},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5846999883651733},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5781999826431274},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4535999894142151},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4375999867916107},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40790000557899475},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34769999980926514},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.3433000147342682},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31299999356269836},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad66269.2025.11240719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad66269.2025.11240719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1806382567","https://openalex.org/W2055477538","https://openalex.org/W2100465945","https://openalex.org/W2152397470","https://openalex.org/W2346205343","https://openalex.org/W2398947418","https://openalex.org/W2962770763","https://openalex.org/W3099525000","https://openalex.org/W3153044352","https://openalex.org/W3163649573","https://openalex.org/W3212743974","https://openalex.org/W4242955624","https://openalex.org/W4282032146","https://openalex.org/W4312288277","https://openalex.org/W4312939266","https://openalex.org/W4313452782","https://openalex.org/W4379536906","https://openalex.org/W4386763476","https://openalex.org/W4386763903","https://openalex.org/W4386764047","https://openalex.org/W4386764162","https://openalex.org/W4389159089","https://openalex.org/W4396680388","https://openalex.org/W4403223198","https://openalex.org/W4404133761","https://openalex.org/W4404134032","https://openalex.org/W4407197178","https://openalex.org/W4409285546","https://openalex.org/W4412196044","https://openalex.org/W4414197367","https://openalex.org/W4414197698","https://openalex.org/W6946434323","https://openalex.org/W6965408216"],"related_works":[],"abstract_inverted_index":{"E-graphs":[0],"have":[1],"attracted":[2],"growing":[3],"interest":[4],"in":[5,9,40,162],"many":[6,31],"fields,":[7,168],"particularly":[8],"logic":[10,166,191],"synthesis":[11,167,192,204],"and":[12,135,165,179,197],"formal":[13,163],"verification.":[14],"E-graph":[15],"extraction":[16,47,91,108,186],"is":[17,213],"a":[18,50,77,117],"challenging":[19],"NP-hard":[20],"combinatorial":[21],"optimization":[22,43],"problem.":[23],"It":[24],"requires":[25],"identifying":[26],"optimal":[27,64],"terms":[28],"from":[29],"exponentially":[30],"equivalent":[32],"expressions,":[33],"serving":[34],"as":[35,145],"the":[36,128,142,159,184],"primary":[37],"performance":[38,105,181],"bottleneck":[39],"e-graph":[41],"based":[42],"tasks.":[44],"However,":[45],"traditional":[46,175],"methods":[48,62],"face":[49,67],"critical":[51],"trade-off:":[52],"heuristic":[53,90],"approaches":[54,177],"offer":[55],"speed":[56],"but":[57,66],"sacrifice":[58],"optimality,":[59],"while":[60,131],"exact":[61,138,176],"provide":[63],"solutions":[65,157],"prohibitive":[68],"computational":[69],"costs":[70,100],"on":[71],"practical":[72],"problems.":[73],"We":[74],"present":[75],"e-boost,":[76],"novel":[78],"framework":[79,187],"that":[80,92,115,140],"bridges":[81],"this":[82],"gap":[83],"through":[84],"three":[85],"key":[86],"innovations:":[87],"(1)":[88],"parallelized":[89],"leverages":[93],"weak":[94],"data":[95],"dependence":[96],"to":[97,121,202],"compute":[98],"DAG":[99],"concurrently,":[101],"enabling":[102],"efficient":[103],"multi-threaded":[104],"without":[106],"sacrificing":[107],"quality;":[109],"(2)":[110],"adaptive":[111],"search":[112],"space":[113,130],"pruning":[114],"employs":[116],"parameterized":[118],"threshold":[119],"mechanism":[120],"retain":[122],"only":[123],"promising":[124],"candidates,":[125],"dramatically":[126],"reducing":[127],"solution":[129],"preserving":[132],"near-optimal":[133],"solutions;":[134],"(3)":[136],"initialized":[137],"solving":[139],"formulates":[141],"reduced":[143],"problem":[144],"an":[146],"Integer":[147],"Linear":[148],"Program":[149],"with":[150,206],"warm-start":[151],"capabilities,":[152],"guiding":[153],"solvers":[154],"toward":[155],"high-quality":[156],"faster.Across":[158],"diverse":[160],"benchmarks":[161],"verification":[164],"e-boost":[169,194,212],"demonstrates":[170],"558\u00d7":[171],"runtime":[172],"speedup":[173],"over":[174,183],"(ILP)":[178],"19.04%":[180],"improvement":[182],"state-of-the-art":[185],"(SmoothE).":[188],"In":[189],"realistic":[190],"tasks,":[193],"produces":[195],"7.6%":[196],"8.1%":[198],"area":[199],"improvements":[200],"compared":[201],"conventional":[203],"tools":[205],"two":[207],"different":[208],"technology":[209],"mapping":[210],"libraries.":[211],"available":[214],"at":[215],"https://github.com/Yu-Maryland/e-boost.":[216]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-20T00:00:00"}