{"id":"https://openalex.org/W3121747663","doi":"https://doi.org/10.3233/fi-2021-1996","title":"The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic","display_name":"The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic","publication_year":2021,"publication_date":"2021-01-13","ids":{"openalex":"https://openalex.org/W3121747663","doi":"https://doi.org/10.3233/fi-2021-1996","mag":"3121747663"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2021-1996","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2021-1996","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065538455","display_name":"Florian Bruse","orcid":"https://orcid.org/0000-0001-6800-7135"},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Florian Bruse","raw_affiliation_strings":["University of Kassel, Kassel, Germany. florian.bruse@uni-kassel.de, martin.lange@uni-kassel.de"],"affiliations":[{"raw_affiliation_string":"University of Kassel, Kassel, Germany. florian.bruse@uni-kassel.de, martin.lange@uni-kassel.de","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087768042","display_name":"Martin Lange","orcid":"https://orcid.org/0000-0002-1621-0972"},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Lange","raw_affiliation_strings":["University of Kassel, Kassel, Germany. florian.bruse@uni-kassel.de, martin.lange@uni-kassel.de"],"affiliations":[{"raw_affiliation_string":"University of Kassel, Kassel, Germany. florian.bruse@uni-kassel.de, martin.lange@uni-kassel.de","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011145361","display_name":"\u00c9tienne Lozes","orcid":"https://orcid.org/0000-0001-8505-585X"},"institutions":[{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Etienne Lozes","raw_affiliation_strings":["University of Nice Sophia Antipolis, I3S, CNRS, France. etienne.lozes@unice.fr"],"affiliations":[{"raw_affiliation_string":"University of Nice Sophia Antipolis, I3S, CNRS, France. etienne.lozes@unice.fr","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065538455"],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":null,"apc_paid":null,"fwci":0.2959,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57649034,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"178","issue":"1-2","first_page":"1","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"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.9952999949455261,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9779999852180481,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9717000126838684,"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/modal-\u03bc-calculus","display_name":"Modal \u03bc-calculus","score":0.7357680797576904},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.731492817401886},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.7109913229942322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6044185161590576},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5957022905349731},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4942024052143097},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4569317698478699},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.4363389313220978},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.409004807472229},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.3972346782684326},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2997397780418396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2644846737384796},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20432546734809875},{"id":"https://openalex.org/keywords/accessibility-relation","display_name":"Accessibility relation","score":0.1861077845096588}],"concepts":[{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.7357680797576904},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.731492817401886},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.7109913229942322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6044185161590576},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5957022905349731},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4942024052143097},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4569317698478699},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.4363389313220978},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.409004807472229},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.3972346782684326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2997397780418396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2644846737384796},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20432546734809875},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.1861077845096588},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2021-1996","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2021-1996","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2086275630","https://openalex.org/W4386167681","https://openalex.org/W2121590963","https://openalex.org/W2977638645","https://openalex.org/W2393457982","https://openalex.org/W4288101226","https://openalex.org/W2153411278","https://openalex.org/W2045916861","https://openalex.org/W4294810627","https://openalex.org/W2006418637"],"abstract_inverted_index":{"Higher-Order":[0],"Fixpoint":[1],"Logic":[2],"(HFL)":[3],"is":[4,40],"a":[5,25,66,69],"modal":[6,30],"specification":[7],"language":[8],"whose":[9],"expressive":[10],"power":[11],"reaches":[12],"far":[13],"beyond":[14],"that":[15,50,77],"of":[16,24,43,53,81,106],"Monadic":[17],"Second-Order":[18],"Logic,":[19],"achieved":[20],"through":[21],"an":[22],"incorporation":[23],"typed":[26],"\u03bb-calculus":[27],"into":[28],"the":[29,104],"\u03bc-calculus.":[31],"Its":[32],"model":[33,72,87],"checking":[34,73],"problem":[35],"on":[36],"finite":[37],"transition":[38],"systems":[39],"decidable,":[41],"albeit":[42],"high":[44],"complexity,":[45],"namely":[46],"k-EXPTIME-complete":[47],"for":[48,103],"formulas":[49,80],"use":[51],"functions":[52],"type":[54,82],"order":[55,83],"at":[56],"most":[57],"k":[58,84],"<":[59],"0.":[60],"In":[61],"this":[62],"paper":[63],"we":[64],"present":[65],"fragment":[67],"with":[68],"presumably":[70],"easier":[71],"problem.":[74],"We":[75],"show":[76],"so-called":[78],"tail-recursive":[79],"can":[85,112],"be":[86,114],"checked":[88],"in":[89,116],"(k":[90],"\u2212":[91],"1)-EXPSPACE,":[92],"and":[93],"also":[94],"give":[95],"matching":[96],"lower":[97],"bounds.":[98],"This":[99],"yields":[100],"generic":[101],"results":[102],"complexity":[105],"bisimulation-invariant":[107],"non-regular":[108],"properties,":[109],"as":[110],"these":[111],"typically":[113],"defined":[115],"HFL.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}