{"id":"https://openalex.org/W2249237842","doi":"https://doi.org/10.1145/2837614.2837627","title":"Unboundedness and downward closures of higher-order pushdown automata","display_name":"Unboundedness and downward closures of higher-order pushdown automata","publication_year":2016,"publication_date":"2016-01-07","ids":{"openalex":"https://openalex.org/W2249237842","doi":"https://doi.org/10.1145/2837614.2837627","mag":"2249237842"},"language":"en","primary_location":{"id":"doi:10.1145/2837614.2837627","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837614.2837627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-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/A5083664380","display_name":"Matthew Hague","orcid":"https://orcid.org/0000-0003-4913-3800"},"institutions":[{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Matthew Hague","raw_affiliation_strings":["University of London, UK"],"affiliations":[{"raw_affiliation_string":"University of London, UK","institution_ids":["https://openalex.org/I124357947"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049219498","display_name":"Jonathan Kochems","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jonathan Kochems","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025152913","display_name":"C.-H. Luke Ong","orcid":"https://orcid.org/0000-0001-7509-680X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"C.-H. Luke Ong","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083664380"],"corresponding_institution_ids":["https://openalex.org/I124357947"],"apc_list":null,"apc_paid":null,"fwci":5.3901,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.95708419,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"151","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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.996999979019165,"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/pushdown-automaton","display_name":"Pushdown automaton","score":0.7830615043640137},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7533594369888306},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.698052167892456},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6948359608650208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6771038174629211},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5985555648803711},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.5662844181060791},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5049956440925598},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4952174723148346},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4590960144996643},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42620474100112915},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4126232862472534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3077579438686371},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.278933584690094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26486146450042725}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7830615043640137},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7533594369888306},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.698052167892456},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6948359608650208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6771038174629211},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5985555648803711},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5662844181060791},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5049956440925598},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4952174723148346},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4590960144996643},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42620474100112915},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4126232862472534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3077579438686371},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.278933584690094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26486146450042725},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2837614.2837627","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837614.2837627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.712.589","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.712.589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rhul.ac.uk/%7Ehague/files/papers/popl16.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.712.9848","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.712.9848","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rhul.ac.uk/%7Ehague/files/papers/popl16-long.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G199299639","display_name":null,"funder_award_id":"EP/K009907/1 and EP/M023974/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2744107465","display_name":null,"funder_award_id":"EP/K009907/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6542465994","display_name":null,"funder_award_id":"EP/M023974/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W2436624","https://openalex.org/W49167929","https://openalex.org/W153330214","https://openalex.org/W173753855","https://openalex.org/W174890186","https://openalex.org/W1492262998","https://openalex.org/W1559784852","https://openalex.org/W1560263126","https://openalex.org/W1594842313","https://openalex.org/W1646789098","https://openalex.org/W1662275540","https://openalex.org/W1976646422","https://openalex.org/W2060345611","https://openalex.org/W2063307580","https://openalex.org/W2071164478","https://openalex.org/W2087046173","https://openalex.org/W2093695603","https://openalex.org/W2094518278","https://openalex.org/W2102644483","https://openalex.org/W2113283923","https://openalex.org/W2114132089","https://openalex.org/W2117842469","https://openalex.org/W2122698067","https://openalex.org/W2135035709","https://openalex.org/W2138316064","https://openalex.org/W2139254765","https://openalex.org/W2140476040","https://openalex.org/W2146549539","https://openalex.org/W2147248565","https://openalex.org/W2156883715","https://openalex.org/W2157976170","https://openalex.org/W2160005349","https://openalex.org/W2165546792","https://openalex.org/W2169417140","https://openalex.org/W2249237842","https://openalex.org/W2277816930","https://openalex.org/W2294925939","https://openalex.org/W2442545619","https://openalex.org/W2610345475","https://openalex.org/W2949151425","https://openalex.org/W4214848047","https://openalex.org/W4242620488","https://openalex.org/W4256174789","https://openalex.org/W4301322018","https://openalex.org/W6601971489"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2331020993","https://openalex.org/W2109489765","https://openalex.org/W2506746226","https://openalex.org/W3104737963","https://openalex.org/W1886746238","https://openalex.org/W2182252111","https://openalex.org/W1541953080","https://openalex.org/W1537446812","https://openalex.org/W2951131748"],"abstract_inverted_index":{"We":[0],"show":[1],"the":[2,12,29,33,48,52],"diagonal":[3],"problem":[4],"for":[5],"higher-order":[6,69,76],"pushdown":[7],"automata":[8],"(HOPDA),":[9],"and":[10],"hence":[11],"simultaneous":[13],"unboundedness":[14],"problem,":[15],"is":[16],"decidable.":[17],"From":[18],"recent":[19],"work":[20],"by":[21,38],"Zetzsche":[22],"this":[23],"means":[24,44],"that":[25],"we":[26,45],"can":[27,46],"construct":[28,47],"downward":[30,49],"closure":[31,50],"of":[32,35,51,55,59],"set":[34],"words":[36],"accepted":[37],"a":[39,56],"given":[40],"HOPDA.":[41,57],"This":[42],"also":[43],"Parikh":[53],"image":[54],"Both":[58],"these":[60],"consequences":[61],"play":[62],"an":[63],"important":[64],"role":[65],"in":[66],"verifying":[67],"concurrent":[68],"programs":[70],"expressed":[71],"as":[72],"HOPDA":[73],"or":[74],"safe":[75],"recursion":[77],"schemes.":[78]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}