A Saturation Method for Collapsible Pushdown Systems

Add to your list(s) Download to your calendar using vCal

• Matthew Hague, Université Paris-Est
• Tuesday 29 May 2012, 12:00-13:00
• CS 217.

If you have a question about this talk, please contact Paul Levy.

Joint Theory Seminar and Lab Lunch

We study the model-checking problem for models of higher-order programs. In particular, via higher-order recursion schemes and their connection to collapsible pushdown systems. We present a saturation method for global backwards reachability analysis of these models. Beginning with an automaton representing a set of configurations, we build an automaton accepting all configurations that can reach this set. We also improve upon previous saturation techniques for higher-order pushdown systems by significantly reducing the size of the automaton constructed and simplifying the algorithm and proofs. This is joint work with C. Broadbent, A. Carayol and O. Serre in Paris.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• CS 217
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.