{"id":"https://openalex.org/W4390603449","doi":"https://doi.org/10.1145/3632888","title":"The Complex(ity) Landscape of Checking Infinite Descent","display_name":"The Complex(ity) Landscape of Checking Infinite Descent","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390603449","doi":"https://doi.org/10.1145/3632888"},"language":"en","primary_location":{"id":"doi:10.1145/3632888","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632888","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632888","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"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 ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3632888","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029629129","display_name":"Liron Cohen","orcid":"https://orcid.org/0000-0002-6608-3000"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Liron Cohen","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beersheba, Israel"],"raw_orcid":"https://orcid.org/0000-0002-6608-3000","affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093658548","display_name":"Adham Jabarin","orcid":"https://orcid.org/0009-0006-1519-7661"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Adham Jabarin","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beersheba, Israel"],"raw_orcid":"https://orcid.org/0009-0006-1519-7661","affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064907118","display_name":"Andrei Popescu","orcid":"https://orcid.org/0000-0001-8747-0619"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrei Popescu","raw_affiliation_strings":["University of Sheffield, Sheffield, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-8747-0619","affiliations":[{"raw_affiliation_string":"University of Sheffield, Sheffield, United Kingdom","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056648657","display_name":"Reuben N. S. Rowe","orcid":"https://orcid.org/0000-0002-4271-9078"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Reuben N. S. Rowe","raw_affiliation_strings":["Royal Holloway University of London, London, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-4271-9078","affiliations":[{"raw_affiliation_string":"Royal Holloway University of London, London, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9654,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75250172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"8","issue":"POPL","first_page":"1352","last_page":"1384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10126","display_name":"Logic, programming, and type systems","score":0.9973999857902527,"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/T11424","display_name":"Security and Verification in Computing","score":0.9753000140190125,"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/mathematical-proof","display_name":"Mathematical proof","score":0.6778650283813477},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.6527158617973328},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.6411788463592529},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.602515459060669},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5951913595199585},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5438398122787476},{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.5433609485626221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5186302065849304},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49092987179756165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45904698967933655},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.45639628171920776},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4553069472312927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.440179705619812},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42934781312942505},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.4208011031150818},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37674450874328613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28589290380477905},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.148462176322937},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11936664581298828}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6778650283813477},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.6527158617973328},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.6411788463592529},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.602515459060669},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5951913595199585},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5438398122787476},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.5433609485626221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5186302065849304},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49092987179756165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45904698967933655},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.45639628171920776},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4553069472312927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.440179705619812},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42934781312942505},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.4208011031150818},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37674450874328613},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28589290380477905},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.148462176322937},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11936664581298828},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3632888","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632888","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632888","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"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 ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:209459","is_oa":true,"landing_page_url":"https://eprints.whiterose.ac.uk/209459/1/3632888.pdf","pdf_url":"https://eprints.whiterose.ac.uk/209459/1/3632888.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"}],"best_oa_location":{"id":"doi:10.1145/3632888","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632888","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632888","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"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 ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390603449.pdf","grobid_xml":"https://content.openalex.org/works/W4390603449.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W152742108","https://openalex.org/W836255558","https://openalex.org/W1506927614","https://openalex.org/W1511995155","https://openalex.org/W1533605922","https://openalex.org/W1548996544","https://openalex.org/W1550751956","https://openalex.org/W1556705528","https://openalex.org/W1568149704","https://openalex.org/W1575501012","https://openalex.org/W1983496086","https://openalex.org/W1993129359","https://openalex.org/W1999823887","https://openalex.org/W2030166143","https://openalex.org/W2039829163","https://openalex.org/W2039977878","https://openalex.org/W2097944031","https://openalex.org/W2106388690","https://openalex.org/W2110082678","https://openalex.org/W2111658460","https://openalex.org/W2118382442","https://openalex.org/W2512685755","https://openalex.org/W2522043470","https://openalex.org/W2564359929","https://openalex.org/W2611853323","https://openalex.org/W2611879577","https://openalex.org/W2752025688","https://openalex.org/W2897097556","https://openalex.org/W2918429258","https://openalex.org/W2952227899","https://openalex.org/W2953665898","https://openalex.org/W2963378790","https://openalex.org/W2963581951","https://openalex.org/W2967943502","https://openalex.org/W3003688551","https://openalex.org/W3092732582","https://openalex.org/W3101659231","https://openalex.org/W3173363254","https://openalex.org/W3198469173","https://openalex.org/W3216290363","https://openalex.org/W4241592569","https://openalex.org/W4281891509","https://openalex.org/W4289104024","https://openalex.org/W4297809295","https://openalex.org/W4385876474","https://openalex.org/W4390603449","https://openalex.org/W6904822121","https://openalex.org/W6948101348"],"related_works":["https://openalex.org/W2138973931","https://openalex.org/W2122706253","https://openalex.org/W3117797724","https://openalex.org/W2195657359","https://openalex.org/W46668428","https://openalex.org/W4294629469","https://openalex.org/W1856383708","https://openalex.org/W3111955738","https://openalex.org/W2954476089","https://openalex.org/W2396504352"],"abstract_inverted_index":{"Cyclic":[0],"proof":[1,20,65],"systems,":[2],"in":[3,51,68,80,103],"which":[4],"induction":[5],"is":[6,22,40],"managed":[7],"implicitly,":[8],"are":[9,59],"a":[10,28,54,134],"promising":[11],"approach":[12],"to":[13,42],"automatic":[14],"verification.":[15],"The":[16],"soundness":[17],"of":[18,36,56,105,108,113,115,129,133,153],"cyclic":[19,64,109],"graphs":[21],"ensured":[23],"by":[24],"checking":[25,37],"them":[26],"against":[27],"trace-based":[29],"Infinite":[30,38,78],"Descent":[31,39,79],"property.":[32],"Although":[33],"the":[34,62,69,111,116,120,127,150,154,159],"problem":[35],"known":[41],"be":[43,138],"PSPACE-complete,":[44],"this":[45,72],"leaves":[46],"much":[47],"room":[48],"for":[49,77,141],"variation":[50],"practice.":[52],"Indeed,":[53],"number":[55,128],"different":[57],"approaches":[58],"employed":[60],"across":[61],"various":[63,167],"systems":[66],"described":[67],"literature.":[70],"In":[71],"paper,":[73],"we":[74],"study":[75],"criteria":[76,88,161],"an":[81],"abstract,":[82],"logic-independent":[83],"setting.":[84],"We":[85,143,157],"look":[86],"at":[87],"based":[89],"on":[90,126,166],"B\u00fcchi":[91],"automata":[92],"encodings":[93],"and":[94,97,119,162],"relational":[95],"abstractions,":[96],"determine":[98],"their":[99,164],"parameterized":[100],"time":[101],"complexities":[102],"terms":[104],"natural":[106],"dimensions":[107],"proofs:":[110],"numbers":[112],"vertices":[114],"proof-tree":[117],"graphs,":[118],"vertex":[121],"width":[122],"\u2014an":[123],"upper":[124],"bound":[125],"components":[130],"(e.g.,":[131],"formulas)":[132],"sequent":[135],"that":[136,147],"can":[137],"simultaneously":[139],"tracked":[140],"descent.":[142],"identify":[144],"novel":[145],"algorithms":[146],"improve":[148],"upon":[149],"parameterised":[151],"complexity":[152],"existing":[155],"algorithms.":[156],"implement":[158],"studied":[160],"compare":[163],"performance":[165],"benchmarks.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}