Unboundedness and Downward Closures of Higher-Order Pushdown Automata
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetsche this means that we can construct the downwards closure of the set of words accepted by a given HOPDA. This also means we can construct the downwards closure of the Parikh image of a HOPDA. Both of these consequences can play an important role in verifying concurrent higher-order programs expressed as HOPDA or safe higher-order recursion schemes.
Wed 20 Jan
|14:20 - 14:45|
|14:45 - 15:10|
String Solving with Word Equations and Transducers: Decidability and Applications to Detecting Mutation XSSMedia Attached
|15:10 - 15:35|
|15:35 - 16:00|