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...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
Association for Computing Machinery
2016
|
| _version_ | 1797086034194857984 |
|---|---|
| author | Hague, M Kochems, J Ong, C |
| author_facet | Hague, M Kochems, J Ong, C |
| author_sort | Hague, M |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-07T02:16:15Z |
| format | Conference item |
| id | oxford-uuid:a255605b-532c-4def-8577-3f8bdae0a79f |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T02:16:15Z |
| publishDate | 2016 |
| publisher | Association for Computing Machinery |
| record_format | dspace |
| spelling | oxford-uuid:a255605b-532c-4def-8577-3f8bdae0a79f2022-03-27T02:19:28ZUnboundedness and downward closures of higher-order pushdown automataConference itemhttp://purl.org/coar/resource_type/c_5794uuid:a255605b-532c-4def-8577-3f8bdae0a79fEnglishSymplectic Elements at OxfordAssociation for Computing Machinery2016Hague, MKochems, JOng, CWe 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. |
| spellingShingle | Hague, M Kochems, J Ong, C Unboundedness and downward closures of higher-order pushdown automata |
| title | Unboundedness and downward closures of higher-order pushdown automata |
| title_full | Unboundedness and downward closures of higher-order pushdown automata |
| title_fullStr | Unboundedness and downward closures of higher-order pushdown automata |
| title_full_unstemmed | Unboundedness and downward closures of higher-order pushdown automata |
| title_short | Unboundedness and downward closures of higher-order pushdown automata |
| title_sort | unboundedness and downward closures of higher order pushdown automata |
| work_keys_str_mv | AT haguem unboundednessanddownwardclosuresofhigherorderpushdownautomata AT kochemsj unboundednessanddownwardclosuresofhigherorderpushdownautomata AT ongc unboundednessanddownwardclosuresofhigherorderpushdownautomata |