{"id":"https://openalex.org/W7160055592","doi":"https://doi.org/10.1016/j.scico.2026.103497","title":"Accelerated bounded model checking with LoAT","display_name":"Accelerated bounded model checking with LoAT","publication_year":2026,"publication_date":"2026-05-01","ids":{"openalex":"https://openalex.org/W7160055592","doi":"https://doi.org/10.1016/j.scico.2026.103497"},"language":"en","primary_location":{"id":"doi:10.1016/j.scico.2026.103497","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.scico.2026.103497","pdf_url":null,"source":{"id":"https://openalex.org/S21029587","display_name":"Science of Computer Programming","issn_l":"0167-6423","issn":["0167-6423","1872-7964"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Science of Computer Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.scico.2026.103497","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087390223","display_name":"Florian Frohn","orcid":"https://orcid.org/0000-0003-0902-1994"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Florian Frohn","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0902-1994","affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025232172","display_name":"J\u00fcrgen Giesl","orcid":"https://orcid.org/0000-0003-0283-8520"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00fcrgen Giesl","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0283-8520","affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087390223"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":2460,"currency":"USD","value_usd":2460},"apc_paid":{"value":2460,"currency":"USD","value_usd":2460},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.59766196,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"253","issue":null,"first_page":"103497","last_page":"103497"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9372000098228455,"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.9372000098228455,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.02280000038444996,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.007799999788403511,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.8981999754905701},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8321999907493591},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.7472000122070312},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6940000057220459},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.4413999915122986},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.3862999975681305},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.3790000081062317}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8981999754905701},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8701000213623047},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8321999907493591},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.7472000122070312},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6940000057220459},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4472000002861023},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.4413999915122986},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4332999885082245},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.3862999975681305},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.3790000081062317},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C93518851","wikidata":"https://www.wikidata.org/wiki/Q180160","display_name":"Metadata","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31709998846054077},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.scico.2026.103497","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.scico.2026.103497","pdf_url":null,"source":{"id":"https://openalex.org/S21029587","display_name":"Science of Computer Programming","issn_l":"0167-6423","issn":["0167-6423","1872-7964"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Science of Computer Programming","raw_type":"journal-article"},{"id":"pmh:oai:publications.rwth-aachen.de:1036374","is_oa":true,"landing_page_url":"https://publications.rwth-aachen.de/record/1036374","pdf_url":"https://publications.rwth-aachen.de/record/1036374/files/1036374.pdf","source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"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":"26. International Symposium on Formal Methods, FM 2024, Milan, Italy, 2024-09-09 - 2024-09-13","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.scico.2026.103497","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.scico.2026.103497","pdf_url":null,"source":{"id":"https://openalex.org/S21029587","display_name":"Science of Computer Programming","issn_l":"0167-6423","issn":["0167-6423","1872-7964"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Science of Computer Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1583869287","https://openalex.org/W3215540032","https://openalex.org/W4402425191"],"related_works":[],"abstract_inverted_index":{"LoAT":[0,57],"is":[1,75],"a":[2,39,69,92],"fully":[3],"automated":[4],"verification":[5],"tool":[6],"that":[7,44,63,81],"can":[8],"prove":[9],"(un)satisfiability":[10],"of":[11,28,77],"linear":[12],"Constrained":[13],"Horn":[14],"Clauses,":[15],"as":[16,18,86],"well":[17],"non-termination":[19],"and":[20,53,72],"lower":[21],"bounds":[22],"on":[23],"the":[24],"worst-case":[25],"runtime":[26],"complexity":[27],"transition":[29],"systems.":[30],"Recently,":[31],"we":[32],"introduced":[33],"Accelerated":[34],"Bounded":[35,49],"Model":[36,50],"Checking":[37,51],"(ABMC),":[38],"novel":[40],"model":[41],"checking":[42],"technique":[43],"combines":[45],"acceleration":[46],"techniques":[47,60],"with":[48,89],"(BMC),":[52],"implemented":[54],"it":[55],"in":[56],".":[58],"Acceleration":[59],"compute":[61],"\u201cshortcuts\u201d":[62],"\u201ccompress\u201d":[64],"many":[65],"execution":[66],"steps":[67],"into":[68],"single":[70],"one,":[71],"thus":[73],"ABMC":[74],"capable":[76],"finding":[78,87],"deep":[79],"counterexamples":[80],"are":[82],"challenging":[83],"for":[84],"BMC,":[85],"them":[88],"BMC":[90],"requires":[91],"large":[93],"bound.":[94]},"counts_by_year":[],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2026-05-05T00:00:00"}