{"id":"https://openalex.org/W2045633736","doi":"https://doi.org/10.1051/ita:2007010","title":"Deciding inclusion of set constants over infinite non-strict data structures","display_name":"Deciding inclusion of set constants over infinite non-strict data structures","publication_year":2007,"publication_date":"2007-04-01","ids":{"openalex":"https://openalex.org/W2045633736","doi":"https://doi.org/10.1051/ita:2007010","mag":"2045633736"},"language":"en","primary_location":{"id":"doi:10.1051/ita:2007010","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2007010","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","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/A5016539119","display_name":"Manfred Schmidt-Schau\u00df","orcid":"https://orcid.org/0000-0001-8809-7385"},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Manfred Schmidt-Schauss","raw_affiliation_strings":["Institut f\u00fcr Informatik, Johann Wolfgang Goethe-Universit\u00e4t, Postfach 11 19 32, 60054 Frankfurt, Germany; schauss@ki.informatik.uni-frankfurt.de"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Johann Wolfgang Goethe-Universit\u00e4t, Postfach 11 19 32, 60054 Frankfurt, Germany; schauss@ki.informatik.uni-frankfurt.de","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031293152","display_name":"David Sabel","orcid":"https://orcid.org/0000-0002-5109-3273"},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"David Sabel","raw_affiliation_strings":["Institut f\u00fcr Informatik, Johann Wolfgang Goethe-Universit\u00e4t, Postfach 11 19 32, 60054 Frankfurt, Germany; schauss@ki.informatik.uni-frankfurt.de"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Johann Wolfgang Goethe-Universit\u00e4t, Postfach 11 19 32, 60054 Frankfurt, Germany; schauss@ki.informatik.uni-frankfurt.de","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023810388","display_name":"Marko Sch\u00fctz","orcid":null},"institutions":[{"id":"https://openalex.org/I44666525","display_name":"University of the South Pacific","ror":"https://ror.org/008stv805","country_code":"FJ","type":"education","lineage":["https://openalex.org/I44666525"]}],"countries":["FJ"],"is_corresponding":false,"raw_author_name":"Marko Sch\u00fctz","raw_affiliation_strings":["Dept. of Mathematics and Computing Science, University of the South Pacific, Suva, Fiji Islands; schutz_m@usp.ac.fj"],"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Computing Science, University of the South Pacific, Suva, Fiji Islands; schutz_m@usp.ac.fj","institution_ids":["https://openalex.org/I44666525"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016539119"],"corresponding_institution_ids":["https://openalex.org/I114090438"],"apc_list":null,"apc_paid":null,"fwci":0.4693,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74614463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"41","issue":"2","first_page":"225","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9950000047683716,"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/decidability","display_name":"Decidability","score":0.7350661158561707},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5654383897781372},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5150058269500732},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5075048804283142},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.448168009519577},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44508761167526245},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.421987920999527},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4124000668525696},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4045572876930237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39051374793052673},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36272692680358887},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20602735877037048}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7350661158561707},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5654383897781372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5150058269500732},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5075048804283142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.448168009519577},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44508761167526245},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.421987920999527},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4124000668525696},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4045572876930237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39051374793052673},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36272692680358887},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20602735877037048},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ita:2007010","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2007010","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:ITA_2007__41_2_225_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ita:2007010/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W138394062","https://openalex.org/W148972334","https://openalex.org/W1494458114","https://openalex.org/W1507316189","https://openalex.org/W1520247096","https://openalex.org/W1529499619","https://openalex.org/W1532312848","https://openalex.org/W1552844739","https://openalex.org/W1559686260","https://openalex.org/W1560050980","https://openalex.org/W1562824671","https://openalex.org/W1593799327","https://openalex.org/W1593983061","https://openalex.org/W1602274351","https://openalex.org/W1855771754","https://openalex.org/W1886159700","https://openalex.org/W1924152497","https://openalex.org/W2017720469","https://openalex.org/W2019553601","https://openalex.org/W2019789808","https://openalex.org/W2043100293","https://openalex.org/W2067567074","https://openalex.org/W2074674709","https://openalex.org/W2088482003","https://openalex.org/W2093397547","https://openalex.org/W2094055760","https://openalex.org/W2120646184","https://openalex.org/W2146730934","https://openalex.org/W2165243410","https://openalex.org/W2652642432","https://openalex.org/W4285719527","https://openalex.org/W6635485671"],"related_works":["https://openalex.org/W2331020993","https://openalex.org/W2972379433","https://openalex.org/W4383764068","https://openalex.org/W1481826604","https://openalex.org/W1797057780","https://openalex.org/W1501430220","https://openalex.org/W3187762542","https://openalex.org/W2583753471","https://openalex.org/W2583549044","https://openalex.org/W2600737272"],"abstract_inverted_index":{"Various":[0],"static":[1],"analyses":[2],"of":[3,14,49,60,79,81],"functional":[4,110],"programming":[5,111],"languages":[6,112],"that":[7,42],"permit":[8],"infinite":[9],"data":[10],"structures":[11],"make":[12],"use":[13,38],"set":[15,40,50,59,94,99],"constants":[16,51],"like":[17],"Top,":[18],"Inf,":[19],"and":[20,32,46,88,93,113],"Bot,":[21],"denoting":[22],"all":[23,25,33,67],"terms,":[24],"lists":[26],"not":[27],"eventually":[28],"ending":[29],"in":[30,57,76,108],"Nil,":[31],"non-terminating":[34],"programs,":[35],"respectively.":[36],"We":[37],"a":[39,53],"language":[41],"permits":[43],"union,":[44],"constructors":[45,69],"recursive":[47],"definition":[48],"with":[52],"greatest":[54],"fixpoint":[55],"semantics":[56],"the":[58,117],"all,":[61],"also":[62,115],"infinite,":[63],"computable":[64],"trees,":[65],"where":[66],"term":[68],"are":[70],"non-strict.":[71],"This":[72],"paper":[73],"proves":[74],"decidability,":[75],"particular":[77],"DEXPTIME-completeness,":[78],"inclusion":[80,100],"co-inductively":[82],"defined":[83],"sets":[84],"by":[85,103],"using":[86],"algorithms":[87,107],"results":[89],"from":[90],"tree":[91],"automata":[92],"constraints.":[95],"The":[96],"test":[97],"for":[98,119],"is":[101],"required":[102],"certain":[104],"strictness":[105],"analysis":[106],"lazy":[109],"could":[114],"be":[116],"basis":[118],"further":[120],"set-based":[121],"analyses.":[122]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
