{"id":"https://openalex.org/W4399852680","doi":"https://doi.org/10.1145/3656387","title":"SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories","display_name":"SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories","publication_year":2024,"publication_date":"2024-06-20","ids":{"openalex":"https://openalex.org/W4399852680","doi":"https://doi.org/10.1145/3656387"},"language":"en","primary_location":{"id":"doi:10.1145/3656387","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656387","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"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 ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3656387","any_repository_has_fulltext":false},"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":false,"raw_author_name":"Benjamin Mikek","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, USA"],"raw_orcid":"https://orcid.org/0000-0002-4195-8464","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"],"raw_orcid":"https://orcid.org/0000-0001-5367-9377","affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.2473,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55051095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"8","issue":"PLDI","first_page":"246","last_page":"271"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9969000220298767,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9883000254631042,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/arbitrage","display_name":"Arbitrage","score":0.7689049243927002},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7081677913665771},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.5411360263824463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5401320457458496},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.3533876836299896},{"id":"https://openalex.org/keywords/financial-economics","display_name":"Financial economics","score":0.2950650453567505},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15301135182380676}],"concepts":[{"id":"https://openalex.org/C160623529","wikidata":"https://www.wikidata.org/wiki/Q273088","display_name":"Arbitrage","level":2,"score":0.7689049243927002},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7081677913665771},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5411360263824463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5401320457458496},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.3533876836299896},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.2950650453567505},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15301135182380676}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3656387","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656387","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"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 ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3656387","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3656387","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"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 ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"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/G1643666990","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":68,"referenced_works":["https://openalex.org/W156574570","https://openalex.org/W190511973","https://openalex.org/W221832247","https://openalex.org/W1128447031","https://openalex.org/W1480909796","https://openalex.org/W1492125336","https://openalex.org/W1493060511","https://openalex.org/W1553142094","https://openalex.org/W1570787829","https://openalex.org/W1586300459","https://openalex.org/W1710734607","https://openalex.org/W1912569824","https://openalex.org/W1938260438","https://openalex.org/W2014764321","https://openalex.org/W2103658959","https://openalex.org/W2103953062","https://openalex.org/W2113159073","https://openalex.org/W2125967324","https://openalex.org/W2134734244","https://openalex.org/W2166280160","https://openalex.org/W2551482414","https://openalex.org/W2566629575","https://openalex.org/W2567628972","https://openalex.org/W2603373584","https://openalex.org/W2604181277","https://openalex.org/W2758443906","https://openalex.org/W2773676607","https://openalex.org/W2888107106","https://openalex.org/W2897273493","https://openalex.org/W2912640545","https://openalex.org/W2930279141","https://openalex.org/W2953973768","https://openalex.org/W2959755401","https://openalex.org/W2963062860","https://openalex.org/W2963355442","https://openalex.org/W3034071395","https://openalex.org/W3040049348","https://openalex.org/W3042552260","https://openalex.org/W3081116997","https://openalex.org/W3138477645","https://openalex.org/W3138624857","https://openalex.org/W3164004581","https://openalex.org/W3174114543","https://openalex.org/W3184692337","https://openalex.org/W3186328512","https://openalex.org/W3211084315","https://openalex.org/W4205181847","https://openalex.org/W4206841187","https://openalex.org/W4206843464","https://openalex.org/W4211076402","https://openalex.org/W4225657323","https://openalex.org/W4225751037","https://openalex.org/W4225922019","https://openalex.org/W4238357211","https://openalex.org/W4241782937","https://openalex.org/W4242219660","https://openalex.org/W4307886659","https://openalex.org/W4311421541","https://openalex.org/W4321242415","https://openalex.org/W4366447030","https://openalex.org/W4379522272","https://openalex.org/W4379537200","https://openalex.org/W4386363496","https://openalex.org/W4387885581","https://openalex.org/W4389162055","https://openalex.org/W6679403131","https://openalex.org/W6745563452","https://openalex.org/W6949284054"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"SMT":[0,19,260],"solvers":[1],"are":[2,106,129,138],"foundational":[3],"tools":[4,26],"for":[5,83,203,258],"reasoning":[6],"about":[7],"constraints":[8,61,86,159,227],"in":[9,62,87,289],"practical":[10,25,213,278],"problems":[11,146],"both":[12],"within":[13,56],"and":[14,27,76,99,108,160,208,232,282],"outside":[15],"program":[16],"analysis.":[17],"Faster":[18],"solving":[20],"improves":[21],"the":[22,29,47,64,89,103,111,193,196,204,249,252],"performance":[23,39,115,156],"of":[24,31,49,66,91,113,154,192,195,206,230,251,266],"expands":[28],"set":[30,90],"tractable":[32],"problems.":[33],"Existing":[34],"approaches":[35],"to":[36,132,141,167,181,235,268],"improving":[37],"solver":[38],"either":[40],"focus":[41,53],"on":[42,54,102,157,240],"general":[43],"algorithms":[44],"applied":[45],"below":[46],"level":[48],"individual":[50,226],"theories,":[51,261],"or":[52],"optimizations":[55],"a":[57,79,121,176,212,236,263,277],"single":[58],"theory.":[59],"Unbounded":[60],"which":[63,88,128,137],"number":[65],"possible":[67,92],"variable":[68],"values":[69,93],"is":[70,94,172,188],"infinite,":[71],"such":[72,96],"as":[73,97],"real":[74,209],"numbers":[75,210],"integers,":[77],"pose":[78],"particularly":[80],"difficult":[81],"challenge":[82],"solvers.":[84],"Bounded":[85],"finite":[95],"bitvectors":[98],"floating-point":[100],"numbers,":[101],"other":[104],"hand,":[105],"decidable":[107],"have":[109],"been":[110],"subject":[112],"extensive":[114],"improvement":[116,288],"efforts.":[117],"This":[118],"paper":[119],"introduces":[120],"theory":[122,150,220],"arbitrage:":[123],"we":[124,273],"transform":[125],"unbounded":[126,145,197,259],"constraints,":[127,136],"often":[130],"expensive":[131],"solve,":[133],"into":[134,147,276],"bounded":[135,148,158,168,185],"typically":[139],"cheaper":[140],"solve.":[142],"By":[143],"converting":[144],"ones,":[149],"arbitrage":[151,221],"takes":[152],"advantage":[153],"better":[155],"unlocks":[161],"optimization":[162],"techniques":[163],"that":[164,219],"only":[165],"apply":[166],"theories.":[169],"The":[170,184],"transformation":[171],"achieved":[173],"by":[174,228],"harnessing":[175],"novel":[177],"abstract":[178],"interpretation":[179],"strategy":[180],"infer":[182],"bounds.":[183],"transformed":[186],"constraint":[187],"then":[189],"an":[190,284],"underapproximation":[191],"semantics":[194],"original.":[198],"We":[199],"realize":[200],"our":[201],"method":[202],"theories":[205],"integers":[207],"with":[211],"tool":[214,281],"(STAUB).":[215],"Our":[216],"evaluation":[217],"demonstrates":[218],"alone":[222],"can":[223],"speed":[224],"up":[225,234,267],"orders":[229],"magnitude":[231],"achieve":[233],"1.4":[237],"\u00d7":[238,270],"speedup":[239,265],"average":[241],"across":[242],"nonlinear":[243],"integer":[244],"benchmarks.":[245],"Furthermore,":[246],"it":[247],"enables":[248],"use":[250],"recent":[253],"compiler":[254],"optimization-based":[255],"technique":[256],"SLOT":[257],"unlocking":[262],"further":[264],"3":[269],".":[271],"Finally,":[272],"incorporate":[274],"STAUB":[275],"termination":[279],"proving":[280],"observe":[283],"overall":[285],"9":[286],"%":[287],"performance.":[290]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}