Sciweavers

Share
POPL
2016
ACM

Unboundedness and downward closures of higher-order pushdown automata

3 years 6 months ago
Unboundedness and downward closures of higher-order pushdown automata
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 rˆole in verifying concurrent higher-order programs expressed as HOPDA or safe higher-order recursion schemes.
Matthew Hague, Jonathan Kochems, C.-H. Luke Ong
Added 09 Apr 2016
Updated 09 Apr 2016
Type Journal
Year 2016
Where POPL
Authors Matthew Hague, Jonathan Kochems, C.-H. Luke Ong
Comments (0)
books