Unboundedness and downward closures of higher-order pushdown automata
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28967535
- Type
- E - Conference contribution
- DOI
-
10.1145/2837614.2837627
- Title of conference / published proceedings
- Principles of Programming Languages : POPL '16
- First page
- 151
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- January
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work tackled a fundamental and surprisingly open problem in the study of higher-order pushdown systems. Several key new ideas were introduced to enable a framework by Zetzsche to be applied to higher-order systems. The work appeared in one of the foremost venues in the field (POPL). The new ideas were picked up by other authors (Bordeaux, Warsaw) in a series of papers generalising the work to higher-order recursion schemes (a slightly more general model), identifying the exact complexity of the problem, and investigating the decidability of boundedness logics over these systems. The acceptance rate of the conference was 23%.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -