2 citations · 2 across the 4 of their papers we have counts for
4 papers · 1 filter
Collapsible Pushdown Parity Games
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague +3
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main mot…
Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations
Taolue Chen, Matthew Hague, Anthony W. Lin +2
The design and implementation of decision procedures for checking path feasibility in string-manipulating programs is an important problem, whose applications include symbolic exec…
Emptiness of Stack Automata is NEXPTIME-complete: A Correction
Christopher Broadbent, Arnaud Carayol, Matthew Hague +1
A saturation algorithm for collapsible pushdown systems was published in ICALP 2012. This work introduced a class of stack automata used to recognised regular sets of collapsible p…
Annotated Stack Trees
Matthew Hague, Vincent Penelle
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification.…