{"id":"https://openalex.org/W7124836021","doi":"https://doi.org/10.1109/aiware69974.2025.00028","title":"Combining Reasoning Optimized LLMs and SMT Solvers for Automated Loop Invariant Synthesis","display_name":"Combining Reasoning Optimized LLMs and SMT Solvers for Automated Loop Invariant Synthesis","publication_year":2025,"publication_date":"2025-11-19","ids":{"openalex":"https://openalex.org/W7124836021","doi":"https://doi.org/10.1109/aiware69974.2025.00028"},"language":null,"primary_location":{"id":"doi:10.1109/aiware69974.2025.00028","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiware69974.2025.00028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 2nd IEEE/ACM International Conference on AI-powered Software (AIware)","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/A5123378983","display_name":"Varun Bharti","orcid":null},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Varun Bharti","raw_affiliation_strings":["IIIT Delhi,New Delhi,India"],"affiliations":[{"raw_affiliation_string":"IIIT Delhi,New Delhi,India","institution_ids":["https://openalex.org/I119939252","https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123451527","display_name":"Shashwat Jha","orcid":null},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shashwat Jha","raw_affiliation_strings":["IIIT Delhi,New Delhi,India"],"affiliations":[{"raw_affiliation_string":"IIIT Delhi,New Delhi,India","institution_ids":["https://openalex.org/I119939252","https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123439325","display_name":"Dhruv Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I74796645","display_name":"Birla Institute of Technology and Science, Pilani","ror":"https://ror.org/001p3jz28","country_code":"IN","type":"education","lineage":["https://openalex.org/I74796645"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Dhruv Kumar","raw_affiliation_strings":["BITS Pilani,New Delhi,India"],"affiliations":[{"raw_affiliation_string":"BITS Pilani,New Delhi,India","institution_ids":["https://openalex.org/I74796645"]}]},{"author_position":"last","author":{"id":null,"display_name":"Pankaj Jalote","orcid":null},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pankaj Jalote","raw_affiliation_strings":["IIIT Delhi,New Delhi,India"],"affiliations":[{"raw_affiliation_string":"IIIT Delhi,New Delhi,India","institution_ids":["https://openalex.org/I119939252","https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5123378983"],"corresponding_institution_ids":["https://openalex.org/I119939252","https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76009538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"192","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.4032000005245209,"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.4032000005245209,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.3499999940395355,"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/T10126","display_name":"Logic, programming, and type systems","score":0.0658000037074089,"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/invariant","display_name":"Invariant (physics)","score":0.6877999901771545},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6843000054359436},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5264000296592712},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4846000075340271},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4772999882698059},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4650999903678894},{"id":"https://openalex.org/keywords/loop-fusion","display_name":"Loop fusion","score":0.45089998841285706}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7053999900817871},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.6877999901771545},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6843000054359436},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5264000296592712},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4846000075340271},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4772999882698059},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4650999903678894},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.453000009059906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45210000872612},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.45089998841285706},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4341999888420105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4235999882221222},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.39980000257492065},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34700000286102295},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.26499998569488525}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aiware69974.2025.00028","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiware69974.2025.00028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 2nd IEEE/ACM International Conference on AI-powered Software (AIware)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1510368738","https://openalex.org/W2043100293","https://openalex.org/W2127574686","https://openalex.org/W2170736936","https://openalex.org/W2888321432","https://openalex.org/W3032926390","https://openalex.org/W4389520453","https://openalex.org/W4407681592"],"related_works":[],"abstract_inverted_index":{"Loop":[0],"invariants":[1,14,35,53],"are":[2,47,191],"essential":[3],"for":[4,24,55,178,194,229],"proving":[5],"the":[6,88,102,130,183,195],"correctness":[7],"of":[8,57,119,133,148,197,224],"programs":[9,108],"with":[10,87,110],"loops.":[11],"Synthesizing":[12],"loop":[13,34,52,165,179,198],"is":[15],"challenging,":[16],"and":[17,39,79,114,145],"fully":[18],"automatic":[19],"synthesis":[20,181],"cannot":[21],"be":[22,211],"guaranteed":[23],"arbitrary":[25],"programs.":[26],"Some":[27],"approaches":[28,46],"have":[29],"been":[30],"proposed":[31],"to":[32,49,95,213],"synthesize":[33,51],"using":[36,42,92],"symbolic":[37],"techniques":[38],"more":[40],"recently":[41],"neural":[43],"approaches.":[44],"These":[45,151],"able":[48],"correctly":[50],"only":[54,137],"subsets":[56],"standard":[58],"benchmarks.":[59],"In":[60],"this":[61,117,208],"work,":[62],"we":[63],"investigate":[64],"whether":[65],"modern,":[66],"reasoning-optimized":[67,173,189],"large":[68],"language":[69],"models":[70,177,190],"can":[71,162],"do":[72],"better.":[73],"We":[74,100],"integrate":[75],"OpenAI's":[76],"O1,":[77],"O1-mini,":[78],"O3-mini":[80],"into":[81],"a":[82],"tightly":[83],"coupled":[84],"generate-and-check":[85],"pipeline":[86],"Z3":[89],"SMT":[90,221],"solver,":[91],"solver":[93,222],"counterexamples":[94],"iteratively":[96],"guide":[97],"invariant":[98,166,180,199],"refinement.":[99],"use":[101],"Code2Inv":[103],"benchmark,":[104],"which":[105,161],"provides":[106],"C":[107,205],"along":[109],"their":[111],"formal":[112],"preconditions":[113],"postconditions.":[115],"On":[116],"benchmark":[118],"133":[120],"tasks,":[121],"our":[122,202],"framework":[123],"achieves":[124],"100":[125],"%":[126],"coverage":[127],"(133/133),":[128],"outperforming":[129],"previous":[131],"best":[132],"107/133,":[134],"while":[135],"requiring":[136],"<tex":[138],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[139],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbf{1}-\\mathbf{2}$</tex>":[140],"model":[141,227],"proposals":[142],"per":[143],"instance":[144],"14-55":[146],"seconds":[147],"wall-clock":[149],"time.":[150],"results":[152],"demonstrate":[153],"that":[154,172,188],"LLMs":[155,174],"possess":[156],"latent":[157],"logical":[158],"reasoning":[159],"capabilities":[160],"help":[163],"automate":[164],"synthesis.":[167],"Our":[168],"experiments":[169,203],"also":[170],"show":[171],"outperform":[175],"non-reasoning":[176],"under":[182],"same":[184],"solver-centric":[185],"pipeline,":[186],"indicating":[187],"better":[192],"suited":[193],"task":[196],"generation.":[200],"While":[201],"target":[204],"-specific":[206],"programs,":[207],"approach":[209],"should":[210],"generalizable":[212],"other":[214],"imperative":[215],"languages":[216],"as":[217],"it":[218],"uses":[219],"an":[220],"instead":[223],"any":[225],"language-specific":[226],"checker":[228],"verification.":[230]},"counts_by_year":[],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2026-01-21T00:00:00"}