default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Hague
Person information
- affiliation: Royal Holloway University of London
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Matthew Hague
, Artur Jez, Anthony W. Lin:
Parikh's Theorem Made Symbolic. Proc. ACM Program. Lang. 8(POPL): 1945-1977 (2024)- 2023
- [i23]Matthew Hague, Artur Jez, Anthony W. Lin:
Parikh's Theorem Made Symbolic. CoRR abs/2311.03901 (2023) - 2022
- [j12]Taolue Chen, Alejandro Flores-Lamas, Matthew Hague, Zhilei Han, Denghang Hu, Shuanglong Kan, Anthony W. Lin, Philipp Rümmer, Zhilin Wu:
Solving string constraints with Regex-dependent functions through transducers with priorities and variables. Proc. ACM Program. Lang. 6(POPL): 1-31 (2022) - 2021
- [j11]Matthew Hague, Igor Potapov:
Preface. Fundam. Informaticae 178(1-2) (2021) - [j10]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. ACM Trans. Comput. Log. 22(3): 16:1-16:51 (2021) - [i22]Taolue Chen, Alejandro Flores-Lamas, Matthew Hague, Zhilei Han, Denghang Hu, Shuanglong Kan, Anthony Widjaja Lin, Philipp Rümmer, Zhilin Wu:
Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables. CoRR abs/2111.04298 (2021) - 2020
- [c28]Taolue Chen, Matthew Hague, Jinlong He, Denghang Hu, Anthony Widjaja Lin, Philipp Rümmer, Zhilin Wu:
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type. ATVA 2020: 325-342 - [c27]Matthew Hague, Anthony W. Lin, Philipp Rümmer, Zhilin Wu:
Monadic Decomposition in Integer Linear Arithmetic. IJCAR (1) 2020: 122-140 - [i21]Matthew Hague, Anthony Widjaja Lin, Philipp Rümmer, Zhilin Wu:
Monadic Decomposition in Integer Linear Arithmetic (Technical Report). CoRR abs/2004.12371 (2020) - [i20]Taolue Chen, Matthew Hague, Jinlong He, Denghang Hu, Anthony Widjaja Lin, Philipp Rümmer, Zhilin Wu:
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type. CoRR abs/2007.06913 (2020) - [i19]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. CoRR abs/2010.06361 (2020)
2010 – 2019
- 2019
- [j9]Taolue Chen, Matthew Hague, Anthony W. Lin, Philipp Rümmer, Zhilin Wu:
Decision procedures for path feasibility of string-manipulating programs with complex operations. Proc. ACM Program. Lang. 3(POPL): 49:1-49:30 (2019) - [j8]Matthew Hague:
Strings at MOSCA. ACM SIGLOG News 6(4): 4-22 (2019) - [j7]Matthew Hague, Anthony W. Lin, Chih-Duo Hong:
CSS Minification via Constraint Solving. ACM Trans. Program. Lang. Syst. 41(2): 12:1-12:76 (2019) - 2018
- [j6]Matthew Hague:
Report on BCTCS 2018. Bull. EATCS 126 (2018) - [j5]Taolue Chen, Yan Chen, Matthew Hague, Anthony W. Lin, Zhilin Wu:
What is decidable about string constraints with the ReplaceAll function. Proc. ACM Program. Lang. 2(POPL): 3:1-3:29 (2018) - [j4]Matthew Hague, Anthony W. Lin:
Decidable models of integer-manipulating programs with recursive parallelism. Theor. Comput. Sci. 750: 24-37 (2018) - [c26]Arnaud Carayol, Matthew Hague:
Optimal Strategies in Pushdown Reachability Games. MFCS 2018: 42:1-42:14 - [c25]Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann:
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. MFCS 2018: 57:1-57:15 - [c24]Matthew Hague, Vincent Penelle:
Constrained Dynamic Tree Networks. RP 2018: 45-58 - [i18]Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann:
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. CoRR abs/1805.02963 (2018) - [i17]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
Emptiness of Stack Automata is NEXPTIME-complete: A Correction. CoRR abs/1805.11873 (2018) - [i16]Taolue Chen, Matthew Hague, Anthony W. Lin, Philipp Rümmer, Zhilin Wu:
Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations. CoRR abs/1811.03167 (2018) - [i15]Matthew Hague, Anthony W. Lin, Chih-Duo Hong:
CSS Minification via Constraint Solving (Technical Report). CoRR abs/1812.02989 (2018) - 2017
- [j3]Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes. ACM Trans. Comput. Log. 18(3): 25:1-25:42 (2017) - [c23]Matthew Hague, Roland Meyer, Sebastian Muskalla:
Domains for Higher-Order Games. MFCS 2017: 59:1-59:15 - [e1]Matthew Hague, Igor Potapov:
Reachability Problems - 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings. Lecture Notes in Computer Science 10506, Springer 2017, ISBN 978-3-319-67088-1 [contents] - [i14]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. CoRR abs/1703.04429 (2017) - [i13]Matthew Hague, Roland Meyer, Sebastian Muskalla:
Domains for Higher-Order Games. CoRR abs/1705.00355 (2017) - [i12]Taolue Chen, Yan Chen, Matthew Hague, Anthony W. Lin, Zhilin Wu:
What Is Decidable about String Constraints with the ReplaceAll Function. CoRR abs/1711.03363 (2017) - 2016
- [c22]Jonathan Hoyland, Matthew Hague:
Generating Concurrency Checks Automatically. FTfJP@ECOOP 2016: 4 - [c21]Matthew Hague, Jonathan Kochems, C.-H. Luke Ong:
Unboundedness and downward closures of higher-order pushdown automata. POPL 2016: 151-163 - [c20]Matthew Hague, Anthony Widjaja Lin:
Decidable Models of Integer-Manipulating Programs with Recursive Parallelism. RP 2016: 148-162 - [i11]Jonathan Hoyland, Matthew Hague:
Generating Concurrency Checks Automatically. CoRR abs/1604.06747 (2016) - [i10]Matthew Hague, Anthony Widjaja Lin:
Decidable models of integer-manipulating programs with recursive parallelism (technical report). CoRR abs/1605.06868 (2016) - 2015
- [c19]Matthew Hague, Anthony Widjaja Lin, C.-H. Luke Ong:
Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach. OOPSLA 2015: 1-19 - [i9]Matthew Hague, Vincent Penelle:
Annotated Stack Trees. CoRR abs/1502.05873 (2015) - [i8]Matthew Hague, Jonathan Kochems, C.-H. Luke Ong:
Unboundedness and Downwards Closures of Higher-Order Pushdown Automata. CoRR abs/1507.03304 (2015) - 2014
- [c18]Matthew Hague:
Senescent ground tree rewrite systems. CSL-LICS 2014: 48:1-48:10 - [c17]Arnaud Carayol, Matthew Hague:
Regular Strategies in Pushdown Reachability Games. RP 2014: 58-71 - [c16]Arnaud Carayol, Matthew Hague:
Saturation algorithms for model-checking pushdown systems. AFL 2014: 1-24 - [i7]Matthew Hague, Anthony Widjaja Lin, Luke Ong:
Detecting Redundant CSS Rules in HTML5 Applications: A Tree-Rewriting Approach. CoRR abs/1412.5143 (2014) - 2013
- [c15]Matthew Hague:
Saturation of Concurrent Collapsible Pushdown Systems. FSTTCS 2013: 313-325 - [c14]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
C-SHORe: a collapsible approach to higher-order verification. ICFP 2013: 13-24 - [i6]Matthew Hague:
Saturation of Concurrent Collapsible Pushdown Systems. CoRR abs/1310.2631 (2013) - [i5]Matthew Hague:
Senescent Ground Tree Rewrite Systems. CoRR abs/1311.4915 (2013) - 2012
- [c13]Matthew Hague, Anthony Widjaja Lin:
Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters. CAV 2012: 260-276 - [c12]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
A Saturation Method for Collapsible Pushdown Systems. ICALP (2) 2012: 165-176 - 2011
- [j2]Matthew Hague, C.-H. Luke Ong:
A saturation method for the modal μ-calculus over pushdown systems. Inf. Comput. 209(5): 799-821 (2011) - [c11]Matthew Hague, Anthony Widjaja Lin:
Model Checking Recursive Programs with Numeric Data Types. CAV 2011: 743-759 - [c10]Matthew Hague:
Parameterised Pushdown Systems with Non-Atomic Writes. FSTTCS 2011: 457-468 - [i4]Matthew Hague:
Parameterised Pushdown Systems with Non-Atomic Writes. CoRR abs/1109.6264 (2011) - 2010
- [c9]Matthew Hague, Anthony Widjaja To:
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems. FSTTCS 2010: 228-239 - [c8]Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81 - [c7]Matthew Hague, C.-H. Luke Ong:
Analysing Mu-Calculus Properties of Pushdown Systems. SPIN 2010: 187-192 - [c6]Gérard Basler, Matthew Hague, Daniel Kroening, C.-H. Luke Ong, Thomas Wahl, Haoxian Zhao:
Boom: Taking Boolean Program Model Checking One Step Further. TACAS 2010: 145-149 - [i3]Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
Extended Computation Tree Logic. CoRR abs/1006.3709 (2010) - [i2]Matthew Hague, C.-H. Luke Ong:
A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems. CoRR abs/1006.5906 (2010)
2000 – 2009
- 2009
- [b1]Matthew Hague:
Saturation methods for global model-checking pushdown systems. University of Oxford, UK, 2009 - [c5]Matthew Hague, C.-H. Luke Ong:
Winning Regions of Pushdown Parity Games: A Saturation Method. CONCUR 2009: 384-398 - 2008
- [j1]Matthew Hague, C.-H. Luke Ong:
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. Log. Methods Comput. Sci. 4(4) (2008) - [c4]Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre:
Winning Regions of Higher-Order Pushdown Games. LICS 2008: 193-204 - [c3]Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes. LICS 2008: 452-461 - [i1]Matthew Hague, C.-H. Luke Ong:
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. CoRR abs/0811.1103 (2008) - 2007
- [c2]Matthew Hague, C.-H. Luke Ong:
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. FoSSaCS 2007: 213-227 - 2005
- [c1]Cristiano Calcagno, Philippa Gardner, Matthew Hague:
From Separation Logic to First-Order Logic. FoSSaCS 2005: 395-409
Coauthor Index
aka: Luke Ong
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
