M
Matthew Hague
Researcher at Royal Holloway, University of London
Publications - 65
Citations - 1059
Matthew Hague is an academic researcher from Royal Holloway, University of London. The author has contributed to research in topics: Decidability & Pushdown automaton. The author has an hindex of 17, co-authored 65 publications receiving 977 citations. Previous affiliations of Matthew Hague include Paris Diderot University & University of Paris.
Papers
More filters
Proceedings ArticleDOI
Collapsible Pushdown Automata and Recursion Schemes
TL;DR: It is shown that the problem of solving parity games over the configuration graphs of order-n CPDA is n-EXPTIME complete, subsuming several well-known results about the solvability of games over higher-order pushdown graphs by (respectively) Walukiewicz, Cachat, and Knapik et al.
Journal ArticleDOI
Collapsible Pushdown Automata and Recursion Schemes
TL;DR: It is shown that the problem of solving parity games over the configuration graphs of order-n CPDA is n-EXPTIME complete, subsuming several well-known results about the solvability of games over higher-order pushdown graphs by (respectively) Walukiewicz, Cachat, and Knapik et al.
Book ChapterDOI
Model checking recursive programs with numeric data types
Matthew Hague,Anthony W. Lin +1 more
TL;DR: This paper pinpoints the decidability/complexity of reachability and linear/branching time model checking over PDS with reversal-bounded counters (PCo), and shows reachability over PCo is NP-complete, while LTL is coNEXP-complete (coNP-complete for fixed formulas).
Journal ArticleDOI
Decision procedures for path feasibility of string-manipulating programs with complex operations
TL;DR: The OSTRICH solver as mentioned in this paper provides a decidable decision procedure for checking path feasibility in string-manipulating programs, which can be used to detect XSS vulnerabilities in web applications.
Book ChapterDOI
A saturation method for collapsible pushdown systems
TL;DR: A natural extension of collapsible pushdown systems called annotated push down systems that replaces collapse links with stack annotations is introduced and a saturation method for global backwards reachability analysis of these models is presented.