@inproceedings{TTBCHS12,
keywords={perso,conf,ERC},
  author    = {Christopher H. Broadbent and
               Arnaud Carayol and
               Matthew Hague and
               Olivier Serre},
  title     = {A Saturation Method for Collapsible Pushdown Systems},
  booktitle = "Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP 2012)",
  year      = {2012},
  pages     = {165-176},
  	Publisher = "Springer-Verlag",
	Series = "Lecture Notes in Computer Science",
	Volume = {7392},
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.},
fulltexturl = {https://hal.archives-ouvertes.fr/hal-00694991},
}

{"_id":"TawNhdsBZoQcdzMe2","bibbaseid":"broadbent-carayol-hague-serre-asaturationmethodforcollapsiblepushdownsystems-2012","downloads":0,"creationDate":"2018-10-09T13:37:34.011Z","title":"A Saturation Method for Collapsible Pushdown Systems","author_short":["Broadbent, C. H.","Carayol, A.","Hague, M.","Serre, O."],"year":2012,"bibtype":"inproceedings","biburl":"https://www.irif.fr/~serre/bibtex/conferences.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","keywords":"perso,conf,ERC","author":[{"firstnames":["Christopher","H."],"propositions":[],"lastnames":["Broadbent"],"suffixes":[]},{"firstnames":["Arnaud"],"propositions":[],"lastnames":["Carayol"],"suffixes":[]},{"firstnames":["Matthew"],"propositions":[],"lastnames":["Hague"],"suffixes":[]},{"firstnames":["Olivier"],"propositions":[],"lastnames":["Serre"],"suffixes":[]}],"title":"A Saturation Method for Collapsible Pushdown Systems","booktitle":"Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP 2012)","year":"2012","pages":"165-176","publisher":"Springer-Verlag","series":"Lecture Notes in Computer Science","volume":"7392","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.","fulltexturl":"https://hal.archives-ouvertes.fr/hal-00694991","bibtex":"@inproceedings{TTBCHS12,\nkeywords={perso,conf,ERC},\n author = {Christopher H. Broadbent and\n Arnaud Carayol and\n Matthew Hague and\n Olivier Serre},\n title = {A Saturation Method for Collapsible Pushdown Systems},\n booktitle = \"Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP 2012)\",\n year = {2012},\n pages = {165-176},\n \tPublisher = \"Springer-Verlag\",\n\tSeries = \"Lecture Notes in Computer Science\",\n\tVolume = {7392},\nabstract = {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.},\nfulltexturl = {https://hal.archives-ouvertes.fr/hal-00694991},\n}\n\n\n","author_short":["Broadbent, C. H.","Carayol, A.","Hague, M.","Serre, O."],"key":"TTBCHS12","id":"TTBCHS12","bibbaseid":"broadbent-carayol-hague-serre-asaturationmethodforcollapsiblepushdownsystems-2012","role":"author","urls":{},"keyword":["perso","conf","ERC"],"downloads":0},"search_terms":["saturation","method","collapsible","pushdown","systems","broadbent","carayol","hague","serre"],"keywords":["perso","conf","erc"],"authorIDs":[],"dataSources":["ymsPGsaH2xrv3xowd"]}