A Saturation Method for Collapsible Pushdown Systems

  • Chris Broadbent
  • Arnaud Carayol
  • Matthew Hague
  • Olivier Serre
Conference paper

DOI: 10.1007/978-3-642-31585-5_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)
Cite this paper as:
Broadbent C., Carayol A., Hague M., Serre O. (2012) A Saturation Method for Collapsible Pushdown Systems. In: Czumaj A., Mehlhorn K., Pitts A., Wattenhofer R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7392. Springer, Berlin, Heidelberg

Abstract

We introduce a natural extension of collapsible pushdown systems called annotated pushdown systems that replaces collapse links with stack annotations. We believe this new model has many advantages. We present a saturation method for global backwards reachability analysis of these models that can also be used to analyse collapsible pushdown systems. 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Chris Broadbent
    • 1
  • Arnaud Carayol
    • 2
  • Matthew Hague
    • 1
    • 2
  • Olivier Serre
    • 1
  1. 1.LIAFAUniversité Paris Diderot – Paris 7 & CNRSFrance
  2. 2.LIGMUniversité Paris-Est & CNRSFrance

Personalised recommendations