{"id":"https://openalex.org/W4289104025","doi":"https://doi.org/10.1007/978-3-031-10769-6_41","title":"Proving Non-Termination and\u00a0Lower Runtime Bounds with\u00a0LoAT (System Description)","display_name":"Proving Non-Termination and\u00a0Lower Runtime Bounds with\u00a0LoAT (System Description)","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4289104025","doi":"https://doi.org/10.1007/978-3-031-10769-6_41"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-10769-6_41","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-10769-6_41","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-10769-6_41.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-10769-6_41.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/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":"Florian Frohn","raw_affiliation_strings":["LuFG Informatik 2, RWTH Aachen University, Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0902-1994","affiliations":[{"raw_affiliation_string":"LuFG Informatik 2, 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":["LuFG Informatik 2, RWTH Aachen University, Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0283-8520","affiliations":[{"raw_affiliation_string":"LuFG Informatik 2, RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":7.9344,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.97994269,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"712","last_page":"722"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9994999766349792,"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/computer-science","display_name":"Computer science","score":0.8626549243927002},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6394836902618408},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.5973331332206726},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5111878514289856},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.4909837543964386},{"id":"https://openalex.org/keywords/normalization-property","display_name":"Normalization property","score":0.45720013976097107},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45322996377944946},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.37725183367729187},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36945128440856934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11063864827156067},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07105660438537598},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.0626496970653534}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8626549243927002},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6394836902618408},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.5973331332206726},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5111878514289856},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.4909837543964386},{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.45720013976097107},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45322996377944946},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37725183367729187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36945128440856934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11063864827156067},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07105660438537598},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0626496970653534},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/978-3-031-10769-6_41","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-10769-6_41","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-10769-6_41.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-10769-6_41","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-10769-6_41","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-10769-6_41.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"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"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4289104025.pdf","grobid_xml":"https://content.openalex.org/works/W4289104025.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W333834217","https://openalex.org/W1496468608","https://openalex.org/W1540580590","https://openalex.org/W1977456312","https://openalex.org/W2277924821","https://openalex.org/W2911894214","https://openalex.org/W2981410213","https://openalex.org/W2985800447","https://openalex.org/W3023362447","https://openalex.org/W3100830552","https://openalex.org/W3183759032"],"related_works":["https://openalex.org/W1559627622","https://openalex.org/W4235686081","https://openalex.org/W24774503","https://openalex.org/W2898087598","https://openalex.org/W1916623740","https://openalex.org/W2014821076","https://openalex.org/W2565094479","https://openalex.org/W2390829436","https://openalex.org/W3160518596","https://openalex.org/W1989791859"],"abstract_inverted_index":{"Abstract":[0],"We":[1,61],"present":[2],"the":[3,27],"Loop":[4],"Acceleration":[5],"Tool":[6],"(),":[7],"a":[8,54],"powerful":[9],"tool":[10],"for":[11,18,33,45],"proving":[12],"non-termination":[13],"and":[14,44,65],"worst-case":[15],"lower":[16],"bounds":[17],"programs":[19],"operating":[20],"on":[21,26,58],"integers.":[22],"It":[23],"is":[24],"based":[25,57],"novel":[28],"calculus":[29],"from":[30],"[10,":[31],"11]":[32],"loop":[34],"acceleration":[35],",":[36],"i.e.,":[37],"transforming":[38],"loops":[39],"into":[40],"non-deterministic":[41],"straight-line":[42],"code,":[43],"finding":[46],"non-terminating":[47],"configurations.":[48],"To":[49],"implement":[50],"it":[51],"efficiently,":[52],"uses":[53],"new":[55],"approach":[56],"unsat":[59],"cores.":[60],"evaluate":[62],"\u2019s":[63],"power":[64],"performance":[66],"by":[67],"extensive":[68],"experiments.":[69]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}