{"id":"https://openalex.org/W3215540032","doi":"https://doi.org/10.1007/s10009-022-00670-2","title":"A calculus for modular loop acceleration and non-termination proofs","display_name":"A calculus for modular loop acceleration and non-termination proofs","publication_year":2022,"publication_date":"2022-10-01","ids":{"openalex":"https://openalex.org/W3215540032","doi":"https://doi.org/10.1007/s10009-022-00670-2","mag":"3215540032"},"language":"en","primary_location":{"id":"doi:10.1007/s10009-022-00670-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10009-022-00670-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10009-022-00670-2.pdf","source":{"id":"https://openalex.org/S122567160","display_name":"International Journal on Software Tools for Technology Transfer","issn_l":"1433-2779","issn":["1433-2779","1433-2787"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Software Tools for Technology Transfer","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10009-022-00670-2.pdf","any_repository_has_fulltext":false},"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/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"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":["LuFG Informatik 2, RWTH Aachen University, Aachen, Germany","Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LuFG Informatik 2, RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045363254","display_name":"Carsten Fuhs","orcid":null},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Carsten Fuhs","raw_affiliation_strings":["Department of Computer Science and Information Systems, Birkbeck, University of London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Systems, Birkbeck, University of London, London, UK","institution_ids":["https://openalex.org/I98259816"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087390223"],"corresponding_institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I887968799"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.761,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72725946,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"24","issue":"5","first_page":"691","last_page":"715"},"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/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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9994000196456909,"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/acceleration","display_name":"Acceleration","score":0.8384583592414856},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.7337580919265747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7148706912994385},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.48042893409729004},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4753819704055786},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.43345609307289124},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.41380631923675537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36482176184654236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24586856365203857},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23066139221191406},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08213376998901367},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06968927383422852}],"concepts":[{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.8384583592414856},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.7337580919265747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7148706912994385},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.48042893409729004},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4753819704055786},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.43345609307289124},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.41380631923675537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36482176184654236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24586856365203857},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23066139221191406},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08213376998901367},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06968927383422852},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10009-022-00670-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10009-022-00670-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10009-022-00670-2.pdf","source":{"id":"https://openalex.org/S122567160","display_name":"International Journal on Software Tools for Technology Transfer","issn_l":"1433-2779","issn":["1433-2779","1433-2787"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Software Tools for Technology Transfer","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10009-022-00670-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10009-022-00670-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10009-022-00670-2.pdf","source":{"id":"https://openalex.org/S122567160","display_name":"International Journal on Software Tools for Technology Transfer","issn_l":"1433-2779","issn":["1433-2779","1433-2787"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Software Tools for Technology Transfer","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[{"id":"https://openalex.org/G3032849772","display_name":null,"funder_award_id":"TRR 248","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8768715795","display_name":"Automatische Terminierungs und Komplexit\u00e4tsanalyse imperativer Programme","funder_award_id":"235950644","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G890954746","display_name":"TRR 248: Grundlagen verst\u00e4ndlicher SoftwareSysteme  f\u00fcr eine nachvollziehbare cyberphysische Welt","funder_award_id":"389792660","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320324232","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3215540032.pdf","grobid_xml":"https://content.openalex.org/works/W3215540032.grobid-xml"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W146333850","https://openalex.org/W333834217","https://openalex.org/W1128447031","https://openalex.org/W1480909796","https://openalex.org/W1496468608","https://openalex.org/W1503406871","https://openalex.org/W1530851674","https://openalex.org/W1532358383","https://openalex.org/W1540580590","https://openalex.org/W1544283013","https://openalex.org/W1580450019","https://openalex.org/W1597840949","https://openalex.org/W1794634288","https://openalex.org/W1821880317","https://openalex.org/W1977456312","https://openalex.org/W1989813138","https://openalex.org/W2031276295","https://openalex.org/W2036804865","https://openalex.org/W2037465794","https://openalex.org/W2095810701","https://openalex.org/W2098022036","https://openalex.org/W2113791307","https://openalex.org/W2119296125","https://openalex.org/W2147263168","https://openalex.org/W2277924821","https://openalex.org/W2338346238","https://openalex.org/W2398327122","https://openalex.org/W2406013780","https://openalex.org/W2467005784","https://openalex.org/W2471272254","https://openalex.org/W2533836568","https://openalex.org/W2568973816","https://openalex.org/W2625924363","https://openalex.org/W2799100779","https://openalex.org/W2911612809","https://openalex.org/W2911894214","https://openalex.org/W2935588095","https://openalex.org/W2942247583","https://openalex.org/W2950560670","https://openalex.org/W2951018967","https://openalex.org/W2956274457","https://openalex.org/W2957046311","https://openalex.org/W2963062860","https://openalex.org/W2981410213","https://openalex.org/W2985800447","https://openalex.org/W3023362447","https://openalex.org/W3032462713","https://openalex.org/W3100830552","https://openalex.org/W3104564121","https://openalex.org/W3105212949","https://openalex.org/W3118742020","https://openalex.org/W3166575995","https://openalex.org/W3183759032","https://openalex.org/W3215540032","https://openalex.org/W4234413063","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W381935118","https://openalex.org/W3002645386","https://openalex.org/W2059970075","https://openalex.org/W2368796975","https://openalex.org/W3037292241","https://openalex.org/W1486100501","https://openalex.org/W2769184051","https://openalex.org/W608305877","https://openalex.org/W2786605369","https://openalex.org/W2998396055"],"abstract_inverted_index":{"Abstract":[0],"Loop":[1],"acceleration":[2,22,50,62,76,86,99,134],"can":[3,89],"be":[4,42,90],"used":[5],"to":[6,72,103],"prove":[7],"safety,":[8],"reachability,":[9],"runtime":[10],"bounds,":[11],"and":[12,68,135],"(non-)termination":[13],"of":[14,21,31,47,97,128],"programs.":[15],"To":[16],"this":[17],"end,":[18],"a":[19,37,45,56,65,115],"variety":[20],"techniques":[23,63,77,87,100],"have":[24,33],"been":[25,34],"proposed.":[26],"However,":[27],"so":[28],"far":[29],"all":[30],"them":[32,108],"monolithic,":[35],"i.e.,":[36],"single":[38],"loop":[39,133],"could":[40],"not":[41],"accelerated":[43],"using":[44],"combination":[46],"several":[48],"different":[49],"techniques.":[51],"In":[52],"contrast,":[53],"we":[54,69,82],"present":[55],"calculus":[57,94,112],"that":[58,88],"allows":[59],"for":[60,119,132,136],"combining":[61,107],"in":[64,114],"modular":[66,117],"way":[67],"show":[70],"how":[71],"integrate":[73],"many":[74],"existing":[75],"into":[78,92],"our":[79,93,110,129],"calculus.":[80],"Moreover,":[81],"propose":[83],"two":[84],"novel":[85,111],"incorporated":[91],"seamlessly.":[95],"Some":[96],"these":[98],"apply":[101],"only":[102],"non-terminating":[104],"loops.":[105],"Thus,":[106],"with":[109],"results":[113],"new,":[116],"approach":[118],"proving":[120,137],"non-termination.":[121,138],"An":[122],"empirical":[123],"evaluation":[124],"demonstrates":[125],"the":[126],"applicability":[127],"approach,":[130],"both":[131]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}