{"id":"https://openalex.org/W4403536499","doi":"https://doi.org/10.1145/3691620.3695512","title":"LLM-Generated Invariants for Bounded Model Checking Without Loop Unrolling","display_name":"LLM-Generated Invariants for Bounded Model Checking Without Loop Unrolling","publication_year":2024,"publication_date":"2024-10-18","ids":{"openalex":"https://openalex.org/W4403536499","doi":"https://doi.org/10.1145/3691620.3695512"},"language":"en","primary_location":{"id":"doi:10.1145/3691620.3695512","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3691620.3695512","pdf_url":null,"source":null,"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 39th IEEE/ACM International Conference on Automated Software Engineering","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3691620.3695512","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114320317","display_name":"Muhammad A. A. Pirzada","orcid":null},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Muhammad A. A. Pirzada","raw_affiliation_strings":["The University of Manchester, Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"The University of Manchester, Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052066515","display_name":"Giles Reger","orcid":"https://orcid.org/0000-0001-6353-952X"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Giles Reger","raw_affiliation_strings":["The University of Manchester, Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"The University of Manchester, Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024155163","display_name":"Ahmed Bhayat","orcid":"https://orcid.org/0000-0002-1343-5084"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ahmed Bhayat","raw_affiliation_strings":["Independent Scholar, Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Independent Scholar, Manchester, United Kingdom","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057689302","display_name":"Lucas C. Cordeiro","orcid":"https://orcid.org/0000-0002-6235-4272"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Lucas C. Cordeiro","raw_affiliation_strings":["The University of Manchester, Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"The University of Manchester, Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5114320317"],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":null,"apc_paid":null,"fwci":1.7736,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.86711614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1395","last_page":"1407"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9889000058174133,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9873999953269958,"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/loop-unrolling","display_name":"Loop unrolling","score":0.9201849699020386},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6684802770614624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6641260385513306},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.596210241317749},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5335674285888672},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.44705313444137573},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3512536883354187},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3426310420036316},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.32410189509391785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18493664264678955},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.12462759017944336},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09767776727676392},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08403843641281128}],"concepts":[{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.9201849699020386},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6684802770614624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6641260385513306},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.596210241317749},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5335674285888672},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44705313444137573},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3512536883354187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3426310420036316},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.32410189509391785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18493664264678955},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.12462759017944336},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09767776727676392},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08403843641281128},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3691620.3695512","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3691620.3695512","pdf_url":null,"source":null,"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 39th IEEE/ACM International Conference on Automated Software Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/2071ad82-928a-4dd7-9bbd-a9d7b8ff9444","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/2071ad82-928a-4dd7-9bbd-a9d7b8ff9444","pdf_url":"https://pure.manchester.ac.uk/ws/files/344502006/ESBMC_and_Vampire.pdf","source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pirzada, M A A, Reger, G, Bhayat, A & Cordeiro, L 2024, LLM-Generated Invariants for Bounded Model Checking Without Loop Unrolling. in 39th IEEE/ACM International Conference on Automated Software Engineering (ASE 2024). https://doi.org/10.1145/3691620.3695512","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3691620.3695512","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3691620.3695512","pdf_url":null,"source":null,"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 39th IEEE/ACM International Conference on Automated Software Engineering","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3060584250","display_name":"SCorCH: Secure Code for Capability Hardware","funder_award_id":"EP/V000497/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G849311619","display_name":null,"funder_award_id":"EP/T026995/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1781094","https://openalex.org/W174184838","https://openalex.org/W1606142489","https://openalex.org/W1972085995","https://openalex.org/W2003141394","https://openalex.org/W2029872263","https://openalex.org/W2043100293","https://openalex.org/W2062071335","https://openalex.org/W2101512909","https://openalex.org/W2110908283","https://openalex.org/W2132661148","https://openalex.org/W2168916522","https://openalex.org/W2179309410","https://openalex.org/W2565255124","https://openalex.org/W2599362873","https://openalex.org/W2912640545","https://openalex.org/W3012558712","https://openalex.org/W3033642953","https://openalex.org/W3033865919","https://openalex.org/W3040578348","https://openalex.org/W3042261571","https://openalex.org/W3138459719","https://openalex.org/W3140308147","https://openalex.org/W4206807714","https://openalex.org/W4210340965","https://openalex.org/W4251912342","https://openalex.org/W4281638823","https://openalex.org/W4282045675","https://openalex.org/W4295882484","https://openalex.org/W4312519821","https://openalex.org/W4367595583","https://openalex.org/W4379598302","https://openalex.org/W4386333898","https://openalex.org/W4389520453","https://openalex.org/W4393942723","https://openalex.org/W4393942893","https://openalex.org/W4393978790","https://openalex.org/W4400680519","https://openalex.org/W6839316307"],"related_works":["https://openalex.org/W2400856453","https://openalex.org/W2093143612","https://openalex.org/W1993103557","https://openalex.org/W1992520403","https://openalex.org/W2212628571","https://openalex.org/W1540273122","https://openalex.org/W2156140864","https://openalex.org/W1985751298","https://openalex.org/W2068352344","https://openalex.org/W2017719803"],"abstract_inverted_index":{"We":[0,46,69],"investigate":[1],"a":[2,34,39,57,77],"modification":[3],"of":[4,30,43,65,105],"the":[5,23,31,44,63,66,85,103,109],"classical":[6],"Bounded":[7],"Model":[8],"Checking":[9],"(BMC)":[10],"procedure":[11],"that":[12,84,117],"does":[13],"not":[14],"handle":[15],"loops":[16],"through":[17],"unrolling":[18],"but":[19],"via":[20],"modifications":[21],"to":[22,61,73],"control":[24],"flow":[25],"graph":[26],"(CFG).":[27],"A":[28],"portion":[29],"CFG":[32],"representing":[33],"loop":[35],"is":[36,90],"replaced":[37],"by":[38,108],"node":[40],"asserting":[41],"invariants":[42,49],"loop.":[45],"generate":[47],"these":[48],"using":[50],"Large":[51],"Language":[52],"Models":[53],"(LLMs)":[54],"and":[55,114,124],"use":[56],"first-order":[58],"theorem":[59],"prover":[60],"ensure":[62],"correctness":[64],"generated":[67],"statements.":[68],"thus":[70],"transform":[71],"programs":[72,97,106,116],"loop-free":[74],"variants":[75],"in":[76],"sound":[78],"manner.":[79],"Our":[80],"experimental":[81],"results":[82],"show":[83],"resulting":[86],"tool,":[87],"ESBMC":[88,113],"ibmc,":[89],"competitive":[91],"with":[92,98],"state-of-the-art":[93,118],"formal":[94],"verifiers":[95,120],"for":[96],"unbounded":[99],"loops,":[100],"significantly":[101],"improving":[102],"number":[104],"verified":[107],"industrial-strength":[110],"software":[111,119],"verifier":[112],"verifying":[115],"such":[121],"as":[122],"SeaHorn":[123],"VeriAbs":[125],"could":[126],"not.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}