papers
Publications (18)
cs.FL2014
Saturation algorithms for model-checking pushdown systems
Arnaud Carayol, Matthew Hague
cs.LO2016
Decidable models of integer-manipulating programs with recursive parallelism (technical report)
Matthew Hague, Anthony Widjaja Lin
cs.FL2013
Saturation of Concurrent Collapsible Pushdown Systems
Matthew Hague
cs.FL2015
Unboundedness and Downward Closures of Higher-Order Pushdown Automata
Matthew Hague, Jonathan Kochems, C. -H. Luke Ong
cs.FL2018
Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations
Taolue Chen, Matthew Hague, Anthony W. Lin +2
cs.LO2015
Detecting Redundant CSS Rules in HTML5 Applications: A Tree-Rewriting Approach
Matthew Hague, Anthony Widjaja Lin, Luke Ong
cs.LO2010
Extended Computation Tree Logic
Roland Axelsson, Matthew Hague, Stephan Kreutzer +2
cs.FL2018
Emptiness of Stack Automata is NEXPTIME-complete: A Correction
Christopher Broadbent, Arnaud Carayol, Matthew Hague +1
cs.FL2011
Parameterised Pushdown Systems with Non-Atomic Writes
Matthew Hague
cs.LO2018
CSS Minification via Constraint Solving (Technical Report)
Matthew Hague, Anthony W. Lin, Chih-Duo Hong
cs.FL2015
Annotated Stack Trees
Matthew Hague, Vincent Penelle
cs.CC2008
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Matthew Hague, C. -H. Luke Ong
cs.LO2018
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems
Matthew Hague, Roland Meyer, Sebastian Muskalla +1
cs.LO2016
Generating Concurrency Checks Automatically
Jonathan Hoyland, Matthew Hague
cs.LO2018
C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation
Christopher Broadbent, Arnaud Carayol, Matthew Hague +1
cs.LO2017
Domains for Higher-Order Games
Matthew Hague, Roland Meyer, Sebastian Muskalla
cs.FL2013
Senescent Ground Tree Rewrite Systems
Matthew Hague
cs.LO2017
What Is Decidable about String Constraints with the ReplaceAll Function
Taolue Chen, Yan Chen, Matthew Hague +2