{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:16Z","timestamp":1753889896249,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2008,12,5]],"date-time":"2008-12-05T00:00:00Z","timestamp":1228435200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Higher-order pushdown systems (PDSs) generalise pushdown systems through the\nuse of higher-order stacks, that is, a nested \"stack of stacks\" structure.\nThese systems may be used to model higher-order programs and are closely\nrelated to the Caucal hierarchy of infinite graphs and safe higher-order\nrecursion schemes.\n  We consider the backwards-reachability problem over higher-order Alternating\nPDSs (APDSs), a generalisation of higher-order PDSs. This builds on and extends\nprevious work on pushdown systems and context-free higher-order processes in a\nnon-trivial manner. In particular, we show that the set of configurations from\nwhich a regular set of higher-order APDS configurations is reachable is regular\nand computable in n-EXPTIME. In fact, the problem is n-EXPTIME-complete.\n  We show that this work has several applications in the verification of\nhigher-order PDSs, such as linear-time model-checking, alternation-free\nmu-calculus model-checking and the computation of winning regions of\nreachability games.<\/jats:p>","DOI":"10.2168\/lmcs-4(4:14)2008","type":"journal-article","created":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T10:25:34Z","timestamp":1231496734000},"source":"Crossref","is-referenced-by-count":7,"title":["Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems"],"prefix":"10.46298","volume":"Volume 4, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4913-3800","authenticated-orcid":false,"given":"Matthew","family":"Hague","sequence":"first","affiliation":[]},{"given":"C. -H. Luke","family":"Ong","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2008,12,5]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/831\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/831\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:57:14Z","timestamp":1681243034000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,5]]},"references-count":0,"URL":"https:\/\/doi.org\/10.2168\/lmcs-4(4:14)2008","relation":{"is-same-as":[{"id-type":"arxiv","id":"0811.1103","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.0811.1103","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-642-31585-5_18","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2008,12,5]]},"article-number":"831"}}