{"id":"https://openalex.org/W2125364400","doi":"https://doi.org/10.1007/3-540-45587-6_16","title":"Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs","display_name":"Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs","publication_year":2001,"publication_date":"2001-12-20","ids":{"openalex":"https://openalex.org/W2125364400","doi":"https://doi.org/10.1007/3-540-45587-6_16","mag":"2125364400"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45587-6_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45587-6_16","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5020698393","display_name":"John P. Gallagher","orcid":"https://orcid.org/0000-0001-6984-7419"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"John P. Gallagher","raw_affiliation_strings":["Dept. of Computer Science, University of Bristol, BS8 1UB, Bristol, UK","University of Bristol"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Bristol, BS8 1UB, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"University of Bristol","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038492725","display_name":"Germ\u00e1n Puebla","orcid":null},"institutions":[{"id":"https://openalex.org/I88060688","display_name":"Universidad Polit\u00e9cnica de Madrid","ror":"https://ror.org/03n6nwv02","country_code":"ES","type":"education","lineage":["https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Germ\u00e1n Puebla","raw_affiliation_strings":["Facultad de Inform\u00e1tica, Universidad Polit\u00e9cnica de Madrid, E-28660, Madrid, Boadilla del Monte","Universidad Polit\u00e9cnica de Madrid"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facultad de Inform\u00e1tica, Universidad Polit\u00e9cnica de Madrid, E-28660, Madrid, Boadilla del Monte","institution_ids":["https://openalex.org/I88060688"]},{"raw_affiliation_string":"Universidad Polit\u00e9cnica de Madrid","institution_ids":["https://openalex.org/I88060688"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.4011,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.93070444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"243","last_page":"261"},"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.9998000264167786,"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.9984999895095825,"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/abstract-interpretation","display_name":"Abstract interpretation","score":0.8775865435600281},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7528494596481323},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.6038264036178589},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5868528485298157},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5395672917366028},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5286747813224792},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5270652770996094},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.524864673614502},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.49452707171440125},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.4756065011024475},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4630143344402313},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4337795376777649},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39930737018585205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19002887606620789}],"concepts":[{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.8775865435600281},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7528494596481323},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.6038264036178589},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5868528485298157},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5395672917366028},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5286747813224792},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5270652770996094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.524864673614502},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.49452707171440125},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.4756065011024475},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4630143344402313},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4337795376777649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39930737018585205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19002887606620789},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-45587-6_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45587-6_16","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.63.2779","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.2779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://clip.dia.fi.upm.es/papers/set-based-absint-padl.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.696.1936","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.1936","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bris.ac.uk/Publications/Papers/1000584.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/b5006164-f8e5-43a4-8c78-9a6f0e1d78dc","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/b5006164-f8e5-43a4-8c78-9a6f0e1d78dc","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gallagher, JP & Puebla, G 2002, Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. in S Krishnamurthi & C R Ramakrishnan (eds), Unknown. Springer Berlin Heidelberg, pp. 243 - 261. < http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=1000612 >","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W2852225","https://openalex.org/W31561947","https://openalex.org/W183453064","https://openalex.org/W202590952","https://openalex.org/W1487533857","https://openalex.org/W1502359129","https://openalex.org/W1503857897","https://openalex.org/W1519880831","https://openalex.org/W1530717542","https://openalex.org/W1532312848","https://openalex.org/W1532363834","https://openalex.org/W1532529131","https://openalex.org/W1549001967","https://openalex.org/W1593799327","https://openalex.org/W1603377515","https://openalex.org/W1607985220","https://openalex.org/W1622844446","https://openalex.org/W1926956344","https://openalex.org/W1965377774","https://openalex.org/W1965825795","https://openalex.org/W1977541831","https://openalex.org/W2004419599","https://openalex.org/W2006990447","https://openalex.org/W2011380290","https://openalex.org/W2058847156","https://openalex.org/W2065590295","https://openalex.org/W2067422029","https://openalex.org/W2069076448","https://openalex.org/W2076696436","https://openalex.org/W2082272211","https://openalex.org/W2110697298","https://openalex.org/W2114277297","https://openalex.org/W2115656500","https://openalex.org/W2124266137","https://openalex.org/W2133654517","https://openalex.org/W2147519178","https://openalex.org/W2163660741","https://openalex.org/W2177713036","https://openalex.org/W2490169810","https://openalex.org/W2914485875","https://openalex.org/W4206370914"],"related_works":["https://openalex.org/W2525463489","https://openalex.org/W1608803044","https://openalex.org/W2157660637","https://openalex.org/W2077499329","https://openalex.org/W2970480852","https://openalex.org/W1836373119","https://openalex.org/W2020973245","https://openalex.org/W1493903037","https://openalex.org/W2968467529","https://openalex.org/W2058895276"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}