A Saturation Method for Collapsible Pushdown Systems

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.
Type de document :
Communication dans un congrès
Automata, Languages and Programming, 39th International Colloquium, ICALP 2012, 2012, Warwick, United Kingdom. Springer, 7392, pp.165-176, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-31585-5_18〉
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00694991
Contributeur : Olivier Serre <>
Soumis le : lundi 7 mai 2012 - 12:09:06
Dernière modification le : mardi 11 octobre 2016 - 13:56:02
Document(s) archivé(s) le : mercredi 8 août 2012 - 02:23:07

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Christopher Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre. A Saturation Method for Collapsible Pushdown Systems. Automata, Languages and Programming, 39th International Colloquium, ICALP 2012, 2012, Warwick, United Kingdom. Springer, 7392, pp.165-176, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-31585-5_18〉. 〈hal-00694991〉

Partager

Métriques

Consultations de la notice

266

Téléchargements de fichiers

115