Affiliation:
1. University of London, UK
2. University of Oxford, UK
Abstract
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words accepted by a given HOPDA. This also means we can construct the downward closure of the Parikh image of a HOPDA. Both of these consequences play an important role in verifying concurrent higher-order programs expressed as HOPDA or safe higher-order recursion schemes.
Funder
Engineering and Physical Sciences Research Council
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Slice closures of indexed languages and word equations with counting constraints;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Verifying Unboundedness via Amalgamation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Existential Definability over the Subword Ordering;Logical Methods in Computer Science;2023-12-21
4. Cost Automata, Safe Schemes, and Downward Closures;Fundamenta Informaticae;2023-04-07
5. General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond;Tools and Algorithms for the Construction and Analysis of Systems;2021