The following pages link to Matthew Hague (Q1623277):
Displayed 19 items.
- Constrained dynamic tree networks (Q1798908) (← links)
- Monadic decomposition in integer linear arithmetic (Q2096441) (← links)
- The Complexity of Model Checking (Collapsible) Higher−Order Pushdown Systems (Q2908852) (← links)
- Parameterised Pushdown Systems with Non-Atomic Writes (Q2911646) (← links)
- Saturation of Concurrent Collapsible Pushdown Systems (Q2963923) (← links)
- A Saturation Method for Collapsible Pushdown Systems (Q3167009) (← links)
- Regular Strategies in Pushdown Reachability Games (Q3447695) (← links)
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems (Q3623010) (← links)
- Senescent ground tree rewrite systems (Q4635633) (← links)
- Extended Computation Tree Logic (Q4933296) (← links)
- (Q4994932) (← links)
- (Q5005144) (← links)
- Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems (Q5005159) (← links)
- Domains for Higher-Order Games (Q5111275) (← links)
- C-SHORe (Q5244783) (← links)
- Foundations of Software Science and Computational Structures (Q5705900) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915901) (← links)
- A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type (Q6485885) (← links)