{"id":"https://openalex.org/W4389162055","doi":"https://doi.org/10.1145/3611643.3616357","title":"Speeding up SMT Solving via Compiler Optimization","display_name":"Speeding up SMT Solving via Compiler Optimization","publication_year":2023,"publication_date":"2023-11-30","ids":{"openalex":"https://openalex.org/W4389162055","doi":"https://doi.org/10.1145/3611643.3616357"},"language":"en","primary_location":{"id":"doi:10.1145/3611643.3616357","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3611643.3616357","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3611643.3616357","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3611643.3616357","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044460206","display_name":"Benjamin Mikek","orcid":"https://orcid.org/0000-0002-4195-8464"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Benjamin Mikek","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078231842","display_name":"Qirun Zhang","orcid":"https://orcid.org/0000-0001-5367-9377"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qirun Zhang","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044460206"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":1.5555,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86735252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1177","last_page":"1189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8966139554977417},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8304096460342407},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7399376630783081},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.601660966873169},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5976406931877136},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5571542978286743},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.5241877436637878},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5089690685272217},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4641386866569519},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4353001117706299},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.30283668637275696},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11445567011833191}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8966139554977417},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8304096460342407},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7399376630783081},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.601660966873169},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5976406931877136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5571542978286743},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.5241877436637878},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5089690685272217},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4641386866569519},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4353001117706299},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.30283668637275696},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11445567011833191}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3611643.3616357","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3611643.3616357","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3611643.3616357","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3611643.3616357","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3611643.3616357","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3611643.3616357","source":null,"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G1453356816","display_name":"SHF:Small: Debug Information Validation for Optimizing Compilers","funder_award_id":"2114627","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1830883894","display_name":"SHF:Small:Scalable and Precise Program Analyses via Linear Conjunctive Language Reachability","funder_award_id":"1917924","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2847475945","display_name":null,"funder_award_id":"1917924, 2114627, 2237440","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3629267508","display_name":"CAREER: Program Analysis with Precise Abstractions","funder_award_id":"2237440","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7542878562","display_name":null,"funder_award_id":"N66001-21-C-402","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8727366907","display_name":null,"funder_award_id":"N66001-21-C-4024","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4389162055.pdf","grobid_xml":"https://content.openalex.org/works/W4389162055.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W156574570","https://openalex.org/W221832247","https://openalex.org/W1128447031","https://openalex.org/W1480909796","https://openalex.org/W1496468608","https://openalex.org/W1586300459","https://openalex.org/W1597469047","https://openalex.org/W1813351732","https://openalex.org/W1973162794","https://openalex.org/W2003164052","https://openalex.org/W2003716509","https://openalex.org/W2243965201","https://openalex.org/W2332117786","https://openalex.org/W2477643358","https://openalex.org/W2515768547","https://openalex.org/W2600774173","https://openalex.org/W2736027423","https://openalex.org/W2758443906","https://openalex.org/W2767683523","https://openalex.org/W2883887424","https://openalex.org/W2883947318","https://openalex.org/W2953315080","https://openalex.org/W2959755401","https://openalex.org/W3004482543","https://openalex.org/W3033150170","https://openalex.org/W3034071395","https://openalex.org/W3104402823","https://openalex.org/W3138477645","https://openalex.org/W3164004581","https://openalex.org/W3174114543","https://openalex.org/W3184692337","https://openalex.org/W3186328512","https://openalex.org/W3195449405","https://openalex.org/W4225922019","https://openalex.org/W4233996382","https://openalex.org/W4241782937","https://openalex.org/W4253004448","https://openalex.org/W4307886659","https://openalex.org/W4309643803","https://openalex.org/W4316662633"],"related_works":["https://openalex.org/W2287565210","https://openalex.org/W2184716478","https://openalex.org/W2002505081","https://openalex.org/W2083681681","https://openalex.org/W2778498407","https://openalex.org/W2577630842","https://openalex.org/W1172579163","https://openalex.org/W1488300410","https://openalex.org/W2138790427","https://openalex.org/W3146558274"],"abstract_inverted_index":{"SMT":[0,19,36,59,78,89,114],"solvers":[1],"are":[2],"fundamental":[3],"tools":[4],"for":[5,84,126],"reasoning":[6],"about":[7],"constraints":[8],"in":[9],"practical":[10],"problems":[11],"like":[12],"symbolic":[13],"execution":[14],"and":[15,25,92,119],"program":[16],"synthesis.":[17],"Faster":[18],"solving":[20,37],"can":[21,107],"improve":[22],"the":[23,85,100,110],"performance":[24],"precision":[26],"of":[27,112,123],"those":[28],"analysis":[29],"tools.":[30],"Existing":[31],"approaches":[32],"typically":[33],"speed":[34],"up":[35,58],"by":[38],"developing":[39],"new":[40,54],"heuristics":[41],"inside":[42],"particular":[43],"solvers,":[44],"which":[45],"requires":[46],"nontrivial":[47],"engineering":[48],"efforts.":[49],"This":[50],"paper":[51],"presents":[52],"a":[53,67],"perspective":[55],"on":[56,99],"speeding":[57],"solving.":[60],"We":[61,81],"propose":[62],"SMT-LLVM":[63],"Optimizing":[64],"Translation":[65],"(SLOT),":[66],"solver-agnostic":[68],"pre-processing":[69],"approach":[70],"that":[71,105],"utilizes":[72],"existing":[73],"compiler":[74],"optimizations":[75],"to":[76],"simplify":[77],"problem":[79],"instances.":[80],"implement":[82],"SLOT":[83,106],"two":[86],"most":[87],"application-critical":[88],"theories,":[90],"bitvectors,":[91],"floating-point":[93],"numbers.":[94],"Our":[95],"extensive":[96],"evaluation":[97],"based":[98],"standard":[101],"SMT-LIB":[102],"benchmarks":[103],"shows":[104],"substantially":[108],"increase":[109],"number":[111],"solvable":[113],"formulas":[115],"given":[116],"fixed":[117],"timeouts":[118],"achieve":[120],"mean":[121],"speedups":[122],"nearly":[124],"3\u00d7":[125],"large":[127],"benchmarks.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}