{"id":"https://openalex.org/W2141598841","doi":"https://doi.org/10.1017/s1471068403001868","title":"A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages","display_name":"A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages","publication_year":2004,"publication_date":"2004-04-16","ids":{"openalex":"https://openalex.org/W2141598841","doi":"https://doi.org/10.1017/s1471068403001868","mag":"2141598841"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068403001868","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068403001868","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","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/A5111600664","display_name":"Patricia M. Hill","orcid":null},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"PATRICIA M. HILL","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, UK (e-mail:","School of Computing, University of Leeds, Leeds, UK (e-mail: hill@comp.leeds.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, UK (e-mail:","institution_ids":["https://openalex.org/I130828816"]},{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, UK (e-mail: hill@comp.leeds.ac.uk)#TAB#","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065794938","display_name":"Enea Zaffanella","orcid":"https://orcid.org/0000-0001-6388-2053"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"ENEA ZAFFANELLA","raw_affiliation_strings":["Department of Mathematics, University of Parma, Parma, Italy (e-mail:","Department of Mathematics, University of Parma, Parma, Italy (e-mail: zaffanella@cs.unipr.it)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Parma, Parma, Italy (e-mail:","institution_ids":["https://openalex.org/I124601658"]},{"raw_affiliation_string":"Department of Mathematics, University of Parma, Parma, Italy (e-mail: zaffanella@cs.unipr.it)#TAB#","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057370941","display_name":"Roberto Bagnara","orcid":"https://orcid.org/0000-0002-6163-6278"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"ROBERTO BAGNARA","raw_affiliation_strings":["Department of Mathematics, University of Parma, Parma, Italy (e-mail:","Department of Mathematics, University of Parma, Parma, Italy (e-mail: bagnara@cs.unipr.it)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Parma, Parma, Italy (e-mail:","institution_ids":["https://openalex.org/I124601658"]},{"raw_affiliation_string":"Department of Mathematics, University of Parma, Parma, Italy (e-mail: bagnara@cs.unipr.it)#TAB#","institution_ids":["https://openalex.org/I124601658"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111600664"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":null,"apc_paid":null,"fwci":2.3127,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89942553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"3","first_page":"289","last_page":"323"},"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.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"}},"topics":[{"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/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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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/correctness","display_name":"Correctness","score":0.8022499084472656},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.7735041975975037},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7717806696891785},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6072254180908203},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5607593655586243},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.554856538772583},{"id":"https://openalex.org/keywords/linearity","display_name":"Linearity","score":0.5221590995788574},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5066879391670227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4897928237915039},{"id":"https://openalex.org/keywords/aliasing","display_name":"Aliasing","score":0.4654460847377777},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.42195743322372437},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4200003445148468},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4147435128688812},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4111281931400299},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.23525986075401306},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1982608437538147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19819888472557068},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06950828433036804}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8022499084472656},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.7735041975975037},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7717806696891785},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6072254180908203},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5607593655586243},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.554856538772583},{"id":"https://openalex.org/C77170095","wikidata":"https://www.wikidata.org/wiki/Q1753188","display_name":"Linearity","level":2,"score":0.5221590995788574},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5066879391670227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4897928237915039},{"id":"https://openalex.org/C4069607","wikidata":"https://www.wikidata.org/wiki/Q868732","display_name":"Aliasing","level":3,"score":0.4654460847377777},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.42195743322372437},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4200003445148468},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4147435128688812},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4111281931400299},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.23525986075401306},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1982608437538147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19819888472557068},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06950828433036804},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1017/s1471068403001868","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068403001868","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:1206","is_oa":false,"landing_page_url":null,"pdf_url":null,"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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.9131","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unipr.it/~bagnara/Papers/PDF/TPLP03a.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.2747","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unipr.it/~bagnara/Papers/PostScript/600dpi/TPLP03a-600DPI.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.9951","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.9951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unipr.it/~bagnara/Papers/PDF/SFL.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.920","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unipr.it/~bagnara/Papers/PostScript/600dpi/SFL-600DPI.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.8960","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.8960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.comp.leeds.ac.uk/scs/doc/reports/2001/2001_22.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.6726","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.6726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unipr.it/~bagnara/Papers/PostScript/600dpi/Q273-600DPI.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.2145","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unipr.it/~bagnara/Papers/PDF/Q273.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W10770331","https://openalex.org/W22241036","https://openalex.org/W60619409","https://openalex.org/W100418935","https://openalex.org/W102863870","https://openalex.org/W147434432","https://openalex.org/W162967427","https://openalex.org/W1485769279","https://openalex.org/W1492188176","https://openalex.org/W1498219406","https://openalex.org/W1509101551","https://openalex.org/W1584053602","https://openalex.org/W1585736418","https://openalex.org/W1591842587","https://openalex.org/W1592019736","https://openalex.org/W1602567617","https://openalex.org/W1627011610","https://openalex.org/W1700937817","https://openalex.org/W1766332311","https://openalex.org/W1785533761","https://openalex.org/W1856681682","https://openalex.org/W1943771961","https://openalex.org/W1965377774","https://openalex.org/W1970730703","https://openalex.org/W2004256601","https://openalex.org/W2014764321","https://openalex.org/W2029950390","https://openalex.org/W2030283734","https://openalex.org/W2035032795","https://openalex.org/W2035855976","https://openalex.org/W2043100293","https://openalex.org/W2044969589","https://openalex.org/W2049896797","https://openalex.org/W2053608039","https://openalex.org/W2057785252","https://openalex.org/W2081673010","https://openalex.org/W2083081801","https://openalex.org/W2103656714","https://openalex.org/W2120329038","https://openalex.org/W2126384248","https://openalex.org/W2131470156","https://openalex.org/W2178196758","https://openalex.org/W2199047740","https://openalex.org/W2219900485","https://openalex.org/W2612793397","https://openalex.org/W2914892239"],"related_works":["https://openalex.org/W2367630557","https://openalex.org/W101666983","https://openalex.org/W2183792531","https://openalex.org/W2595286499","https://openalex.org/W2794344379","https://openalex.org/W2471908688","https://openalex.org/W1845283042","https://openalex.org/W3171337446","https://openalex.org/W2884423176","https://openalex.org/W2616882931"],"abstract_inverted_index":{"It":[0],"is":[1,47],"well":[2],"known":[3],"that":[4,81],"freeness":[5,42],"and":[6,18,43,61,73,96,123],"linearity":[7,44],"information":[8,87],"positively":[9],"interact":[10],"with":[11,41],"aliasing":[12],"information,":[13,45],"allowing":[14],"both":[15,69],"the":[16,19,22,63,66,70,74,82,112,125,130],"precision":[17,127],"efficiency":[20],"of":[21,25,39,65,85,114],"sharing":[23],"analysis":[24,67],"logic":[26],"programs":[27],"to":[28,104],"be":[29],"improved.":[30],"In":[31],"this":[32,105,109],"paper,":[33],"we":[34,79],"present":[35],"a":[36,57],"novel":[37],"combination":[38],"set-sharing":[40],"which":[46],"characterized":[48],"by":[49],"an":[50,115],"improved":[51],"abstract":[52,106,116],"unification":[53,117],"operator.":[54],"We":[55],"provide":[56],"new":[58],"abstraction":[59],"function":[60],"prove":[62],"correctness":[64],"for":[68,111],"finite":[71],"tree":[72,76],"rational":[75],"cases.":[77],"Moreover,":[78],"show":[80],"same":[83,126],"notion":[84],"redundant":[86],"as":[88],"identified":[89],"in":[90,120],"Bagnara":[91],"et":[92,98],"al":[93,99],".":[94,100],"(2000)":[95],"Zaffanella":[97],"(2002)":[101],"also":[102],"applies":[103],"domain":[107],"combination:":[108],"allows":[110],"implementation":[113],"operator":[118],"running":[119],"polynomial":[121],"time":[122],"achieving":[124],"on":[128],"all":[129],"considered":[131],"observable":[132],"properties.":[133]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}