Matthew Hague

Orcid: 0000-0003-4913-3800

Affiliations:
  • Royal Holloway University of London


According to our database1, Matthew Hague authored at least 47 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parikh's Theorem Made Symbolic.
Proc. ACM Program. Lang., January, 2024

2022
Solving string constraints with Regex-dependent functions through transducers with priorities and variables.
Proc. ACM Program. Lang., 2022

2021
Collapsible Pushdown Parity Games.
ACM Trans. Comput. Log., 2021

Preface.
Fundam. Informaticae, 2021

2020
Monadic Decomposition in Integer Linear Arithmetic (Technical Report).
CoRR, 2020

Monadic Decomposition in Integer Linear Arithmetic.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type.
Proceedings of the Automated Technology for Verification and Analysis, 2020

2019
CSS Minification via Constraint Solving.
ACM Trans. Program. Lang. Syst., 2019

Strings at MOSCA.
ACM SIGLOG News, 2019

Decision procedures for path feasibility of string-manipulating programs with complex operations.
Proc. ACM Program. Lang., 2019

2018
Decidable models of integer-manipulating programs with recursive parallelism.
Theor. Comput. Sci., 2018

What is decidable about string constraints with the ReplaceAll function.
Proc. ACM Program. Lang., 2018

Report on BCTCS 2018.
Bull. EATCS, 2018

CSS Minification via Constraint Solving (Technical Report).
CoRR, 2018

Emptiness of Stack Automata is NEXPTIME-complete: A Correction.
CoRR, 2018

Constrained Dynamic Tree Networks.
Proceedings of the Reachability Problems - 12th International Conference, 2018

Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Optimal Strategies in Pushdown Reachability Games.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Collapsible Pushdown Automata and Recursion Schemes.
ACM Trans. Comput. Log., 2017

C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation.
CoRR, 2017

Domains for Higher-Order Games.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Decidable models of integer-manipulating programs with recursive parallelism (technical report).
CoRR, 2016

Unboundedness and downward closures of higher-order pushdown automata.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Generating Concurrency Checks Automatically.
Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs, 2016

2015
Annotated Stack Trees.
CoRR, 2015

Unboundedness and Downwards Closures of Higher-Order Pushdown Automata.
CoRR, 2015

Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach.
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015

2014
Saturation algorithms for model-checking pushdown systems.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Regular Strategies in Pushdown Reachability Games.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

Senescent ground tree rewrite systems.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
C-SHORe: a collapsible approach to higher-order verification.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

Saturation of Concurrent Collapsible Pushdown Systems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
A Saturation Method for Collapsible Pushdown Systems.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
A saturation method for the modal μ-calculus over pushdown systems.
Inf. Comput., 2011

Parameterised Pushdown Systems with Non-Atomic Writes.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Model Checking Recursive Programs with Numeric Data Types.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems
CoRR, 2010

Boom: Taking Boolean Program Model Checking One Step Further.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Analysing Mu-Calculus Properties of Pushdown Systems.
Proceedings of the Model Checking Software, 2010

Extended Computation Tree Logic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Saturation methods for global model-checking pushdown systems.
PhD thesis, 2009

Winning Regions of Pushdown Parity Games: A Saturation Method.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.
Log. Methods Comput. Sci., 2008

Winning Regions of Higher-Order Pushdown Games.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2005
From Separation Logic to First-Order Logic.
Proceedings of the Foundations of Software Science and Computational Structures, 2005


  Loading...