Output details
11 - Computer Science and Informatics
Royal Holloway, University of London
Return to search
Output 0 of 0 in the submission
Output title
Collapsible Pushdown Automata and Recursion Schemes
Type
E - Conference contribution
Name of conference/published proceedings
LICS '08: 23rd Annual IEEE Symposium on Logic in Computer Science
Volume number
-
Issue number
-
First page of article
452
ISSN of proceedings
-
Year of publication
2008
Number of additional authors
3
Additional information
<07>This paper introduces the first automata model of Higher-Order Recursion Schemes. This model has been widely picked up in the field. For example, it was used by Pawel Parys to solve two long-standing open problems (a resolution to the "safety conjecture" and a "pumping lemma"). It also provides the underlying model of the recent tool C-SHORe (http://www.cshore.cs.rhul.ac.uk) for verifying higher-order programs, which is due to appear in ICFP this year, and is the model that will form the basis of a recent EPSRC Early Career Fellowship awarded to the author (EP/K009907/1)
Interdisciplinary
-
Cross-referral requested
-
Research group
C - Centre for Software Language Engineering
Citation count
33
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
