Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:pure.royalholloway.ac.uk:publications/0f3c0b5d-84cf-4a15-b7d5-4651138d34bd

Unboundedness and downward closures of higher-order pushdown automata

Authors
Publication date
11 January 2016
Publisher
ACM
Doi

    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

    Similar works

    Full text

    thumbnail-image

    This paper was published in Royal Holloway - Pure.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.