{"id":"https://openalex.org/W4205913186","doi":"https://doi.org/10.1145/3498709","title":"A formal foundation for symbolic evaluation with merging","display_name":"A formal foundation for symbolic evaluation with merging","publication_year":2022,"publication_date":"2022-01-12","ids":{"openalex":"https://openalex.org/W4205913186","doi":"https://doi.org/10.1145/3498709"},"language":"en","primary_location":{"id":"doi:10.1145/3498709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498709","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","license_id":"https://openalex.org/licenses/cc-by","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://dl.acm.org/doi/pdf/10.1145/3498709","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051441125","display_name":"Sorawee Porncharoenwase","orcid":"https://orcid.org/0000-0003-3900-5602"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sorawee Porncharoenwase","raw_affiliation_strings":["University of Washington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069494158","display_name":"Luke Nelson","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Luke Nelson","raw_affiliation_strings":["University of Washington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100442242","display_name":"Xi Wang","orcid":"https://orcid.org/0000-0002-0641-0882"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xi Wang","raw_affiliation_strings":["University of Washington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088791029","display_name":"Emina Torlak","orcid":"https://orcid.org/0000-0002-1155-2711"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emina Torlak","raw_affiliation_strings":["University of Washington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":2.6946,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89733707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":"POPL","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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/symbolic-execution","display_name":"Symbolic execution","score":0.8512093424797058},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7923941612243652},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6461889743804932},{"id":"https://openalex.org/keywords/concolic-testing","display_name":"Concolic testing","score":0.62517911195755},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6132424473762512},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.5877134203910828},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.5471947193145752},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5319068431854248},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5170751214027405},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.506355881690979},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.5005397796630859},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.44176238775253296},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.431841105222702},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.11079609394073486}],"concepts":[{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.8512093424797058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7923941612243652},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6461889743804932},{"id":"https://openalex.org/C11219265","wikidata":"https://www.wikidata.org/wiki/Q5158734","display_name":"Concolic testing","level":4,"score":0.62517911195755},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6132424473762512},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.5877134203910828},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.5471947193145752},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5319068431854248},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5170751214027405},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.506355881690979},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.5005397796630859},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.44176238775253296},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.431841105222702},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.11079609394073486}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3498709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498709","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","license_id":"https://openalex.org/licenses/cc-by","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/3498709","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3498709","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3498709","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","license_id":"https://openalex.org/licenses/cc-by","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":[{"score":0.75,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G4377053310","display_name":"CAREER:  The Next 700 Solver-Aided Languages","funder_award_id":"1651225","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4568100143","display_name":null,"funder_award_id":"CCF-1651225, CCF-1836724, CNS-1844807","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4967461180","display_name":"FMitF: A Framework for Synthesis of Efficient, Reliable, and Secure Operating System Components","funder_award_id":"1836724","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5495359703","display_name":"CAREER: A Framework for Automated Verification of Hypervisors","funder_award_id":"1844807","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320316785","display_name":"VMware","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4205913186.pdf","grobid_xml":"https://content.openalex.org/works/W4205913186.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W109452506","https://openalex.org/W1439634531","https://openalex.org/W1464569014","https://openalex.org/W1480909796","https://openalex.org/W2014764321","https://openalex.org/W2043100293","https://openalex.org/W2080575293","https://openalex.org/W2091345373","https://openalex.org/W2101512909","https://openalex.org/W2109276114","https://openalex.org/W2129538349","https://openalex.org/W2130371489","https://openalex.org/W2136601052","https://openalex.org/W2149236697","https://openalex.org/W2163671349","https://openalex.org/W2171999426","https://openalex.org/W2278821771","https://openalex.org/W2313930557","https://openalex.org/W2330908417","https://openalex.org/W2332661323","https://openalex.org/W2493296585","https://openalex.org/W2536639940","https://openalex.org/W2564212270","https://openalex.org/W2739754451","https://openalex.org/W2751239020","https://openalex.org/W2751650279","https://openalex.org/W2753416529","https://openalex.org/W2768658963","https://openalex.org/W2787976344","https://openalex.org/W2898543817","https://openalex.org/W2935677582","https://openalex.org/W2963827670","https://openalex.org/W2964342690","https://openalex.org/W2974073952","https://openalex.org/W3010081385","https://openalex.org/W3011737828","https://openalex.org/W3033206483","https://openalex.org/W3034071395","https://openalex.org/W4245618235","https://openalex.org/W4246691913","https://openalex.org/W4252567017"],"related_works":["https://openalex.org/W2101264565","https://openalex.org/W3141167149","https://openalex.org/W2287565210","https://openalex.org/W2044213223","https://openalex.org/W345638404","https://openalex.org/W4254035807","https://openalex.org/W2514597554","https://openalex.org/W2782813868","https://openalex.org/W4245197793","https://openalex.org/W3170793698"],"abstract_inverted_index":{"Reusable":[0],"symbolic":[1,104,110,145,157,197,203,237,356],"evaluators":[2,77,114,120],"are":[3],"a":[4,24,30,38,108,134,144,162,270,371,378],"key":[5,191],"building":[6],"block":[7],"of":[8,20,51,59,85,102,137,152,156,194,202,222,264,308,349,367,374,385],"solver-aided":[9,301],"verification":[10,315],"and":[11,29,62,87,128,154,171,173,178,199,218,244,252,258,276,294,316],"synthesis":[12,317],"tools.":[13,387],"A":[14],"reusable":[15,103,330],"evaluator":[16,53,272,281,331],"reduces":[17],"the":[18,52,57,60,63,73,93,100,150,195,200,230,249,262,292,306,334,346,365,383],"semantics":[19,111,140,160,182],"all":[21],"paths":[22],"in":[23,75,274,283],"program":[25],"to":[26,36,56,68,124,185,205,215,234,248,291,322],"logical":[27],"constraints,":[28],"client":[31,213,223,386],"tool":[32,61],"uses":[33],"these":[34,76,113],"constraints":[35],"formulate":[37,216],"satisfiability":[39],"query":[40],"that":[41,115,165,240,254,332,361,381],"is":[42,54,141,183,242,327],"discharged":[43],"with":[44,169,246,289],"SAT":[45],"or":[46],"SMT":[47],"solvers.":[48],"The":[49,159,181],"correctness":[50],"critical":[55],"soundness":[58],"domain":[64],"properties":[65],"it":[66,210,241,255],"aims":[67],"guarantee.":[69],"Yet":[70],"so":[71],"far,":[72],"trust":[74],"has":[78],"been":[79],"based":[80],"on":[81,225],"an":[82,279,328],"ad-hoc":[83],"foundation":[84],"testing":[86,221],"manual":[88],"reasoning.":[89],"This":[90],"paper":[91],"presents":[92],"first":[94],"formal":[95],"framework":[96],"for":[97,112,212],"reasoning":[98],"about":[99],"behavior":[101],"evaluators.":[105],"We":[106,228,285],"develop":[107,268],"new":[109],"incorporates":[116],"state":[117,122],"merging.":[118],"Symbolic":[119],"use":[121,229],"merging":[123,153,336],"avoid":[125],"path":[126],"explosion":[127],"generate":[129],"compact":[130],"encodings.":[131],"To":[132,260,304],"accommodate":[133],"wide":[135,372],"range":[136,373],"implementations,":[138],"our":[139,236,265,309],"parameterized":[142],"by":[143,188],"factory,":[146],"which":[147],"abstracts":[148],"away":[149],"details":[151],"creation":[155],"values.":[158],"targets":[161],"rich":[163],"language":[164],"extends":[166],"Core":[167],"Scheme":[168],"assumptions":[170],"assertions,":[172],"thus":[174],"supports":[175],"branching,":[176],"loops,":[177],"(first-class)":[179],"procedures.":[180],"designed":[184],"support":[186],"reusability,":[187],"guaranteeing":[189],"two":[190],"properties:":[192],"legality":[193,257],"generated":[196],"states,":[198],"reducibility":[201,219],"evaluation":[204],"concrete":[206,226,250],"evaluation.":[207],"Legality":[208],"makes":[209],"simpler":[211],"tools":[214,224,318],"queries,":[217],"enables":[220],"inputs.":[227],"Lean":[231],"theorem":[232],"prover":[233],"mechanize":[235],"semantics,":[238,251,266,293,337],"prove":[239,253,286],"sound":[243],"complete":[245],"respect":[247,290],"guarantees":[256],"reducibility.":[259],"demonstrate":[261,305],"generality":[263],"we":[267,311],"Leanette,":[269],"reference":[271],"written":[273,282],"Lean,":[275],"Rosette":[277,296,320,323,325,343,350,362,368],"4,":[278],"optimized":[280,355],"Racket.":[284],"Leanette":[287,299],"correct":[288],"validate":[295],"4":[297,344,363],"against":[298],"via":[300],"differential":[302],"testing.":[303],"practicality":[307],"approach,":[310],"port":[312],"16":[313],"published":[314],"from":[319,339],"3":[321,326,351,369],"4.":[324],"existing":[329],"implements":[333],"classic":[335],"adopted":[338],"bounded":[340],"model":[341],"checking.":[342],"replaces":[345],"semantic":[347],"core":[348],"but":[352],"keeps":[353],"its":[354],"factory.":[357],"Our":[358],"results":[359],"show":[360],"matches":[364],"performance":[366],"across":[370],"benchmarks,":[375],"while":[376],"providing":[377],"cleaner":[379],"interface":[380],"simplifies":[382],"implementation":[384]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}