{"id":"https://openalex.org/W4414988634","doi":"https://doi.org/10.1145/3763167","title":"Interactive Bitvector Reasoning using Verified Bit-Blasting","display_name":"Interactive Bitvector Reasoning using Verified Bit-Blasting","publication_year":2025,"publication_date":"2025-10-09","ids":{"openalex":"https://openalex.org/W4414988634","doi":"https://doi.org/10.1145/3763167"},"language":"en","primary_location":{"id":"doi:10.1145/3763167","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763167","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","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://doi.org/10.1145/3763167","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119918322","display_name":"Henrik B\u00f6ving","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henrik B\u00f6ving","raw_affiliation_strings":["Lean FRO, Munich, Germany"],"raw_orcid":"https://orcid.org/0009-0007-8294-2710","affiliations":[{"raw_affiliation_string":"Lean FRO, Munich, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087494634","display_name":"Siddharth Bhat","orcid":"https://orcid.org/0009-0007-6410-3681"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Siddharth Bhat","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"raw_orcid":"https://orcid.org/0009-0007-6410-3681","affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Luisa Cicolini","orcid":"https://orcid.org/0000-0002-8826-9607"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Luisa Cicolini","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-8826-9607","affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119918323","display_name":"Alex Keizer","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alex Keizer","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"raw_orcid":"https://orcid.org/0009-0007-9831-6968","affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092888740","display_name":"L\u00e9on Frenot","orcid":"https://orcid.org/0009-0000-1880-0602"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"L\u00e9on Frenot","raw_affiliation_strings":["ENS Lyon, Lyon, France"],"raw_orcid":"https://orcid.org/0009-0000-1880-0602","affiliations":[{"raw_affiliation_string":"ENS Lyon, Lyon, France","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075703355","display_name":"Abdalrhman Mohamed","orcid":"https://orcid.org/0000-0003-1414-7073"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abdalrhman Mohamed","raw_affiliation_strings":["Stanford University, Stanford, USA"],"raw_orcid":"https://orcid.org/0000-0003-1414-7073","affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015933495","display_name":"L\u00e9o Stefanesco","orcid":"https://orcid.org/0000-0002-4719-2922"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"L\u00e9o Stefanesco","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-4719-2922","affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071750209","display_name":"Harun Khan","orcid":"https://orcid.org/0000-0003-3379-5631"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Harun Khan","raw_affiliation_strings":["Stanford University, Stanford, USA"],"raw_orcid":"https://orcid.org/0000-0003-3379-5631","affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004455254","display_name":"Joshua Clune","orcid":"https://orcid.org/0000-0003-4047-6196"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Clune","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0003-4047-6196","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026961968","display_name":"Clark Barrett","orcid":"https://orcid.org/0000-0002-9522-3084"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clark Barrett","raw_affiliation_strings":["Stanford University, Stanford, USA"],"raw_orcid":"https://orcid.org/0000-0002-9522-3084","affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055618037","display_name":"Tobias Grosser","orcid":"https://orcid.org/0000-0003-3874-6003"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tobias Grosser","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-3874-6003","affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2831,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.86023518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"9","issue":"OOPSLA2","first_page":"3259","last_page":"3285"},"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.9997000098228455,"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.9983999729156494,"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6761000156402588},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6733999848365784},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.5835000276565552},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4065999984741211},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.39910000562667847},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.39739999175071716},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.36800000071525574},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.34610000252723694}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8504999876022339},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6761000156402588},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6733999848365784},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.65829998254776},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.5835000276565552},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41679999232292175},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4065999984741211},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.39739999175071716},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C89288958","wikidata":"https://www.wikidata.org/wiki/Q7301504","display_name":"Reasoning system","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.28690001368522644},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.2865000069141388},{"id":"https://openalex.org/C97364631","wikidata":"https://www.wikidata.org/wiki/Q484284","display_name":"Deductive reasoning","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.27799999713897705},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.2590999901294708}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3763167","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763167","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","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/3763167","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763167","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","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":[],"awards":[{"id":"https://openalex.org/G556367437","display_name":null,"funder_award_id":"101070375","funder_id":"https://openalex.org/F4320334322","funder_display_name":"HORIZON EUROPE Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320334322","display_name":"HORIZON EUROPE Framework Programme","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W15103390","https://openalex.org/W41329643","https://openalex.org/W197756383","https://openalex.org/W1480909796","https://openalex.org/W1497011154","https://openalex.org/W1571434026","https://openalex.org/W1579437898","https://openalex.org/W1595209293","https://openalex.org/W1599039905","https://openalex.org/W1820726602","https://openalex.org/W1853199847","https://openalex.org/W1900292471","https://openalex.org/W1903118409","https://openalex.org/W1926206757","https://openalex.org/W2036085256","https://openalex.org/W2054859958","https://openalex.org/W2059960896","https://openalex.org/W2077391533","https://openalex.org/W2089666999","https://openalex.org/W2129487583","https://openalex.org/W2130920933","https://openalex.org/W2133527541","https://openalex.org/W2158211562","https://openalex.org/W2221578313","https://openalex.org/W2562195480","https://openalex.org/W2564212270","https://openalex.org/W2735882127","https://openalex.org/W2744897459","https://openalex.org/W2767162229","https://openalex.org/W2899599233","https://openalex.org/W2981188613","https://openalex.org/W3033189783","https://openalex.org/W3040288220","https://openalex.org/W3047617131","https://openalex.org/W3164004581","https://openalex.org/W3183490041","https://openalex.org/W4225922019","https://openalex.org/W4239031877","https://openalex.org/W4246166885","https://openalex.org/W4246691913","https://openalex.org/W4254983202","https://openalex.org/W4298447450","https://openalex.org/W4308219437","https://openalex.org/W4384521894","https://openalex.org/W4388958855","https://openalex.org/W4400433830","https://openalex.org/W4400973078","https://openalex.org/W6893278509","https://openalex.org/W6910297888"],"related_works":[],"abstract_inverted_index":{"Bit-blasting":[0],"SMT":[1,44,178,309],"solvers":[2,45],"enable":[3,190,217,342],"efficient":[4,33],"automatic":[5],"reasoning":[6,35,51,93,110,144,254,331,346],"about":[7],"bitvectors,":[8],"which":[9,249],"are":[10],"fundamental":[11],"for":[12,32,63,107,221,256,273,347],"the":[13,29,38,84,88,101,129,184,242,257,288,298,315],"verification":[14,193,318],"of":[15,91,176,186,194,244,285,319,338],"compiler":[16,131],"backends,":[17],"cryptographic":[18],"algorithms,":[19],"hardware":[20,26],"designs":[21],"and":[22,37,77,80,132,134,212,224,266,271,335],"other":[23],"soft-":[24],"or":[25,70,235],"tasks.":[27],"Despite":[28],"clear":[30],"demand":[31],"bitvector":[34,50,67,92,109,205,247,330],"infrastructure":[36],"impressive":[39],"advancements":[40],"in":[41,94,111,151,300],"state-of-the-art":[42,299],"bit-blasting":[43,219,329],"such":[46],"as":[47,137],"Bitwuzla,":[48],"effective":[49],"within":[52,147],"interactive":[53,108,143,192,228,336],"theorem":[54],"provers":[55],"(ITPs)":[56],"remains":[57],"a":[58,112,123,138,148,208,233,237,268,282,332],"challenge,":[59],"hindering":[60],"their":[61],"use":[62,156],"mechanized":[64,317],"proofs.":[65],"Incomplete":[66],"libraries,":[68],"unavailable":[69],"only":[71,128],"partially":[72],"integrated":[73],"decision":[74],"procedures,":[75],"complex":[76],"hard-to-bitblast":[78],"operations,":[79],"limited":[81],"integration":[82],"with":[83,122],"host":[85],"language":[86],"prevent":[87],"wide":[89],"adoption":[90],"proving":[95],"contexts.":[96],"We":[97,155,189,276,304],"introduce":[98],"bv_decide":[99,293],":":[100],"first":[102],"end-to-end":[103,125],"verified":[104,117,301],"bitblaster":[105,118],"designed":[106],"dependently-typed":[113],"ITP":[114],".":[115],"Our":[116],"is":[119,135,264],"scalable,":[120],"comes":[121],"complete":[124],"proof":[126,139],"(trusting":[127],"Lean":[130],"kernel),":[133],"available":[136],"tactic":[140,229],"that":[141,173,230],"allows":[142],"right":[145],"from":[146,210,312],"programming":[149],"language,":[150],"our":[152,166,204,279,325],"case":[153],"Lean.":[154],"Lean\u2019s":[157,198,245],"Functional":[158],"But":[159],"In-Place":[160],"(FBIP)":[161],"paradigm":[162],"to":[163,214,216,322,324],"efficiently":[164],"encode":[165],"core":[167],"data":[168],"structures":[169],"(e.g.,":[170],"AIGs),":[171],"demonstrating":[172],"fast":[174],"execution":[175],"an":[177,227],"solver":[179],"need":[180],"not":[181],"come":[182],"at":[183],"expense":[185],"rigorous":[187],"formalization.":[188],"dependable":[191,344],"user-written-code":[195],"by":[196,225],"basing":[197],"C-Style":[199],"standard":[200,260],"dataypes":[201],"UInt/SInt":[202],"on":[203,281],"type,":[206],"adding":[207],"lowering":[209],"enums":[211],"structs":[213],"bitvectors":[215],"transparent":[218],"support":[220],"composed":[222],"types,":[223],"offering":[226],"either":[231],"solves":[232,294],"goal":[234],"provides":[236],"counter-example.":[238],"Moreover,":[239],"we":[240,341],"present":[241],"design":[243],"canonical":[246],"library,":[248],"supports":[250],"all":[251],"operations":[252],"(with":[253],"principles)":[255],"SMT-LIB":[258,290],"2.7":[259],"(including":[261],"overflow":[262],"modeling),":[263],"fast-to-execute,":[265],"offers":[267],"comprehensive":[269,283],"API":[270],"automation":[272],"bit-width-independent":[274],"reasoning.":[275],"thoroughly":[277],"evaluate":[278],"bit-blaster":[280],"set":[284],"benchmarks,":[286],"including":[287],"full":[289],"dataset,":[291],"where":[292],"more":[295],"theorems":[296],"than":[297],"bit-blasting,":[302],"CoqQFBV.":[303],"also":[305],"verify":[306],"over":[307],"7000":[308],"statements":[310],"extracted":[311],"LLVM,":[313],"providing":[314],"largest":[316],"LLVM":[320],"rewrites":[321],"date,":[323],"knowledge.":[326],"By":[327],"making":[328],"polished,":[333],"well-supported,":[334],"feature":[337],"modern":[339],"ITPs,":[340],"effective,":[343],"white-box":[345],"bitvector-level":[348],"verification.":[349]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-17T05:52:16.776730","created_date":"2025-10-10T00:00:00"}