BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Theoretical computer science seminar
SUMMARY:A Saturation Method for Collapsible Pushdown Syste
ms - Matthew Hague\, Université Paris-Est
DTSTART:20120529T110000Z
DTEND:20120529T120000Z
UID:TALK835AT
URL:/talk/index/835
DESCRIPTION:We study the model-checking problem for models of
higher-order programs.\n In particular\, via high
er-order recursion schemes and their connection to
\n collapsible pushdown systems. We present a sa
turation method for global\n backwards reachabili
ty analysis of these models. Beginning with an\n
automaton representing a set of configurations\,
we build an automaton\n accepting all configurati
ons that can reach this set. We also improve upon
\n previous saturation techniques for higher-orde
r pushdown systems by\n significantly reducing th
e size of the automaton constructed and\n simplif
ying the algorithm and proofs. This is joint work
with C.\n Broadbent\, A. Carayol and O. Serre in
Paris.\n
LOCATION:CS 217
CONTACT:Paul Levy
END:VEVENT
END:VCALENDAR