{"id":"https://openalex.org/W7162511746","doi":"https://doi.org/10.48550/arxiv.2605.27051","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","display_name":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","publication_year":2026,"publication_date":"2026-05-26","ids":{"openalex":"https://openalex.org/W7162511746","doi":"https://doi.org/10.48550/arxiv.2605.27051"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.27051","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27051","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.27051","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114320317","display_name":"Muhammad A. A. Pirzada","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pirzada, Muhammad A. A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137119510","display_name":"Weiqi Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Weiqi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092031091","display_name":"Yiannis Charalambous","orcid":"https://orcid.org/0009-0000-5755-5099"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Charalambous, Yiannis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040847270","display_name":"Konstantin Korovin","orcid":"https://orcid.org/0000-0002-0740-621X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Korovin, Konstantin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126505762","display_name":"Lucas C. Cordeiro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cordeiro, Lucas C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5579000115394592,"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.5579000115394592,"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/T11424","display_name":"Security and Verification in Computing","score":0.156700000166893,"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/T10126","display_name":"Logic, programming, and type systems","score":0.08009999990463257,"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/benchmark","display_name":"Benchmark (surveying)","score":0.6262999773025513},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.569599986076355},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.5620999932289124},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5443000197410583},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.527400016784668},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5212000012397766},{"id":"https://openalex.org/keywords/software-verification","display_name":"Software verification","score":0.5105999708175659},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4837000072002411},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.42480000853538513}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8174999952316284},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6262999773025513},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.569599986076355},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.5620999932289124},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5443000197410583},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.527400016784668},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5228000283241272},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5212000012397766},{"id":"https://openalex.org/C33054407","wikidata":"https://www.wikidata.org/wiki/Q6504747","display_name":"Software verification","level":5,"score":0.5105999708175659},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4837000072002411},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.42480000853538513},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.414000004529953},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.39719998836517334},{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.385699987411499},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.3840000033378601},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.3815999925136566},{"id":"https://openalex.org/C202973057","wikidata":"https://www.wikidata.org/wiki/Q7380130","display_name":"Runtime verification","level":3,"score":0.3776000142097473},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.36739999055862427},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3449000120162964},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2612999975681305}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.27051","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27051","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.27051","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27051","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Formal":[0],"verification":[1,38,50,115],"of":[2,94,107,123,154,184,214],"large":[3,55],"C":[4,42,110,179],"programs":[5,125],"is":[6],"impeded":[7],"by":[8,27],"state-space":[9],"explosion:":[10],"Bounded":[11],"Model":[12],"Checking":[13],"(BMC)":[14],"tools":[15],"must":[16],"encode":[17],"the":[18,24,64,104,133,151,160,182,185,195],"entire":[19],"state":[20],"space":[21],"up":[22],"to":[23,59,178,190,201],"predetermined":[25],"bound":[26],"unrolling":[28],"all":[29],"nested":[30],"constructs.":[31],"We":[32,87,193,207],"present":[33,169],"ConVer,":[34],"a":[35,41,45,54,74,80,128,171],"top-down":[36],"compositional":[37],"tool.":[39],"Given":[40],"program":[43],"with":[44,121],"top-level":[46],"assertion,":[47],"ConVer":[48,89,112,143,189,210],"decomposes":[49],"top-down:":[51],"it":[52],"uses":[53],"language":[56],"model":[57],"(LLM)":[58],"synthesise":[60],"function":[61],"contracts":[62,78],"from":[63],"system":[65],"property,":[66],"then":[67],"alternates":[68],"system-level":[69],"and":[70,97,138,146,157],"function-level":[71],"checks":[72],"in":[73],"CEGAR-CEGIS":[75,130],"loop,":[76],"refining":[77],"whenever":[79],"check":[81],"fails":[82],"via":[83],"SMART":[84],"ICE":[85],"learning.":[86],"evaluate":[88],"on":[90],"four":[91],"benchmark":[92,106,136],"suites":[93],"increasing":[95],"difficulty":[96],"against":[98],"other":[99],"state-of-the-art":[100],"(SOTA)":[101],"tools.":[102],"On":[103,132,150],"Frama-C":[105],"45":[108],"simple":[109],"programs,":[111,159],"achieves":[113,144,163],"82-96%":[114],"success":[116,148],"across":[117],"three":[118],"LLM":[119],"backends,":[120],"93-95%":[122],"converged":[124],"requiring":[126],"only":[127],"single":[129],"iteration.":[131],"X.509":[134],"parser":[135],"(6~programs)":[137],"LF2C-Simple":[139],"suite":[140,153],"(17":[141],"programs),":[142],"33-50%":[145],"82-88%":[147],"respectively.":[149],"VerifyThis":[152],"11":[155],"recursive":[156],"loop-intensive":[158],"Pre-Abstraction":[161],"strategy":[162],"55-64%":[164],"success.":[165],"In":[166],"addition,":[167],"we":[168,203],"ESBMC-LF":[170,200],"preprocessor":[172],"tool":[173],"that":[174,209],"converts":[175],"LF":[176,186,196],"models":[177],"while":[180],"preserving":[181],"properties":[183],"files,":[187],"enabling":[188],"verify":[191],"them.":[192],"transpile":[194],"Verifier":[197],"Benchmarks":[198],"using":[199],"C;":[202],"denote":[204],"those":[205],"LF-Hard.":[206],"show":[208],"successfully":[211],"verifies":[212],"67%":[213],"LF-Hard":[215],"benchmarks":[216],"overall.":[217]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-28T00:00:00"}