معرفی
Matthew Hague is a Professor at the Department of Computer Science, Royal Holloway University of London. His research focuses on theoretical and practical aspects of infinite-state verification, with a particular emphasis on higher-order recursion and counter systems.
Education:
- MEng in Computing, Imperial College London
- DPhil (PhD) in Computer Science, University of Oxford
Research Interests: Matthew's work spans infinite-state systems verification, higher-order program analysis, string constraint solving, and pushdown automata. He develops practical tools like Ostrich (for string constraints), C-SHORe (for HORS analysis), TreePed (for CSS optimization), and PDSolver (for pushdown parity games).
Scientific Contributions: His recent work includes symbolic Parikh's theorem applications (2024), regex-dependent string constraint solving (2022), collapsible pushdown parity games (2021), and path feasibility analysis with integer data types (2020). These span formal methods, automata theory, and programming language design.
Awards & Grants:
- EPSRC Early Career Fellowship (2013-2018)
- EPSRC Grant for String Constraint Solving (PI, 2019-2022)
Academic Leadership: Matthew has supervised numerous PhD students including Emma Lieu and Jonathan Hoyland, and organized key conferences like BCTCS 2018 and ICALP 2026. He maintains active involvement in program committees for POPL, LICS, and MFCS.
Laboratory Tools: He leads development of Ostrich (string constraint solver), PDSolver (pushdown system analysis), and C-SHORe (higher-order verification) tools.
