Skip to main navigation Skip to search Skip to main content

A saturation method for collapsible pushdown systems

  • Université Paris 7
  • Université Paris-Est

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAutomata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings
PublisherSpringer Verlag
Pages165-176
Number of pages12
EditionPART 2
ISBN (Print)9783642315848
DOIs
Publication statusPublished - 1 Jan 2012
Externally publishedYes
Event39th International Colloquium on Automata, Languages, and Programming, ICALP 2012 - Warwick, United Kingdom
Duration: 9 Jul 201213 Jul 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume7392 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference39th International Colloquium on Automata, Languages, and Programming, ICALP 2012
Country/TerritoryUnited Kingdom
CityWarwick
Period9/07/1213/07/12

Fingerprint

Dive into the research topics of 'A saturation method for collapsible pushdown systems'. Together they form a unique fingerprint.

Cite this