{"id":"https://openalex.org/W2591301625","doi":"https://doi.org/10.2168/lmcs-4(4:14)2008","title":"Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems","display_name":"Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems","publication_year":2008,"publication_date":"2008-12-05","ids":{"openalex":"https://openalex.org/W2591301625","doi":"https://doi.org/10.2168/lmcs-4(4:14)2008","mag":"2591301625"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-4(4:14)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:14)2008","pdf_url":"https://lmcs.episciences.org/831/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/831/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Matthew Hague","orcid":"https://orcid.org/0000-0003-4913-3800"},"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":true,"raw_author_name":"Matthew Hague","raw_affiliation_strings":["Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, UK, OX1 3QD"],"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, UK, OX1 3QD","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":null,"display_name":"C. -H. Luke Ong","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":"C. -H. Luke Ong","raw_affiliation_strings":["Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, UK, OX1 3QD"],"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, UK, OX1 3QD","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.827,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78350236,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"Volume 4, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9384999871253967,"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.9384999871253967,"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.03449999913573265,"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.01940000057220459,"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/reachability","display_name":"Reachability","score":0.788100004196167},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6801000237464905},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6593999862670898},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6154000163078308},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4918000102043152},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.49140000343322754},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4693000018596649},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4462999999523163}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.788100004196167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6820999979972839},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6801000237464905},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6593999862670898},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6154000163078308},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5364000201225281},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4918000102043152},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.49140000343322754},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4693000018596649},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4462999999523163},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.41690000891685486},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.3752000033855438},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.35670000314712524},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3440999984741211},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3325999975204468},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.31290000677108765},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2867000102996826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2791000008583069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2759999930858612},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C199879729","wikidata":"https://www.wikidata.org/wiki/Q205140","display_name":"Infinite set","level":3,"score":0.26339998841285706},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.257099986076355}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-4(4:14)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:14)2008","pdf_url":"https://lmcs.episciences.org/831/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0811.1103","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0811.1103","pdf_url":"https://arxiv.org/pdf/0811.1103","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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"},{"id":"pmh:oai:doaj.org/article:38898c7d17ff4ed7ab18b5af7f46ba7f","is_oa":true,"landing_page_url":"https://doaj.org/article/38898c7d17ff4ed7ab18b5af7f46ba7f","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 4, Issue 4 (2008)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-4(4:14)2008","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-4(4:14)2008","pdf_url":"https://lmcs.episciences.org/831/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6667452092","display_name":null,"funder_award_id":"EP/F036361/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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2591301625.pdf","grobid_xml":"https://content.openalex.org/works/W2591301625.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W119381390","https://openalex.org/W157185084","https://openalex.org/W260642817","https://openalex.org/W1489854863","https://openalex.org/W1497837776","https://openalex.org/W1512310098","https://openalex.org/W1513485037","https://openalex.org/W1518696294","https://openalex.org/W1585989904","https://openalex.org/W1589224558","https://openalex.org/W1630801303","https://openalex.org/W1971416129","https://openalex.org/W1975653808","https://openalex.org/W1979853884","https://openalex.org/W2073412815","https://openalex.org/W2083398633","https://openalex.org/W2083896385","https://openalex.org/W2102644483","https://openalex.org/W2117501670","https://openalex.org/W2123277897","https://openalex.org/W2138308600","https://openalex.org/W2140476040","https://openalex.org/W6630667583","https://openalex.org/W6633632479","https://openalex.org/W6683874757","https://openalex.org/W6822517396"],"related_works":[],"abstract_inverted_index":{"Higher-order":[0],"pushdown":[1,5,69],"systems":[2,6,22,70],"(PDSs)":[3],"generalise":[4],"through":[7],"the":[8,35,48,84,107,120,133],"use":[9],"of":[10,18,38,58,86,93,122,135,138],"higher-order":[11,28,43,52,59,73,94,123],"stacks,":[12],"that":[13,83,113],"is,":[14],"a":[15,56,76,90],"nested":[16],"\"stack":[17],"stacks\"":[19],"structure.":[20],"These":[21],"may":[23],"be":[24],"used":[25],"to":[26,34],"model":[27],"programs":[29],"and":[30,41,64,71,101,132],"are":[31],"closely":[32],"related":[33],"Caucal":[36],"hierarchy":[37],"infinite":[39],"graphs":[40],"safe":[42],"recursion":[44],"schemes.":[45],"We":[46,111],"consider":[47],"backwards-reachability":[49],"problem":[50,108],"over":[51],"Alternating":[53],"PDSs":[54],"(APDSs),":[55],"generalisation":[57],"PDSs.":[60],"This":[61],"builds":[62],"on":[63,68],"extends":[65],"previous":[66],"work":[67,115],"context-free":[72],"processes":[74],"in":[75,103,119],"non-trivial":[77],"manner.":[78],"In":[79,105],"particular,":[80],"we":[81],"show":[82,112],"set":[85,92],"configurations":[87,96],"from":[88],"which":[89],"regular":[91,100],"APDS":[95],"is":[97,99,109],"reachable":[98],"computable":[102],"n-EXPTIME.":[104],"fact,":[106],"n-EXPTIME-complete.":[110],"this":[114],"has":[116],"several":[117],"applications":[118],"verification":[121],"PDSs,":[124],"such":[125],"as":[126],"linear-time":[127],"model-checking,":[128],"alternation-free":[129],"mu-calculus":[130],"model-checking":[131],"computation":[134],"winning":[136],"regions":[137],"reachability":[139],"games.":[140]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-03-03T00:00:00"}