M. F. Atig, Global model checking of ordered multi-pushdown systems, FSTTCS, pp.216-227, 2010.

T. Ball and S. K. Rajamani, The SLAM project: Debugging system software via static analysis, POPL, pp.1-3, 2002.

A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking, In CONCUR, pp.135-150, 1997.
DOI : 10.1007/3-540-63141-0_10

A. Bouajjani and A. Meyer, Symbolic Reachability Analysis of Higher-Order Context-Free Processes, FSTTCS, pp.135-147, 2004.
DOI : 10.1007/978-3-540-30538-5_12
URL : https://hal.archives-ouvertes.fr/hal-00149812

C. H. Broadbent, A. Carayol, C. Ong, and O. Serre, Recursion Schemes and Logical Reflection, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.120-129, 2010.
DOI : 10.1109/LICS.2010.40
URL : https://hal.archives-ouvertes.fr/hal-00479818

T. Cachat, Games on Pushdown Graphs and Extensions, 2003.

A. Carayol and S. Wöhrle, The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata, FSTTCS, pp.112-123, 2003.
DOI : 10.1007/978-3-540-24597-1_10

W. Damm, The IO- and OI-hierarchies, Theoretical Computer Science, vol.20, issue.2, pp.95-207, 1982.
DOI : 10.1016/0304-3975(82)90009-3

J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon, Efficient Algorithms for Model Checking Pushdown Systems, CAV, pp.232-247, 2000.
DOI : 10.1007/10722167_20

A. Finkel, B. Willems, and P. Wolper, A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract), Electronic Notes in Theoretical Computer Science, vol.9, pp.27-37, 1997.
DOI : 10.1016/S1571-0661(05)80426-8

M. Hague, A. S. Murawski, C. Ong, and O. Serre, Collapsible Pushdown Automata and Recursion Schemes, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.452-461, 2008.
DOI : 10.1109/LICS.2008.34
URL : https://hal.archives-ouvertes.fr/hal-00345945

M. Hague and C. L. Ong, Symbolic backwards-reachability analysis for higherorder pushdown systems, Logical Methods in Computer Science, vol.4, issue.4, 2008.

M. Hague and C. L. Ong, Analysing Mu-Calculus Properties of Pushdown Systems, In SPIN, pp.187-192, 2010.
DOI : 10.1007/978-3-642-16164-3_14

M. Hague and C. L. Ong, A saturation method for the modal ??-calculus over pushdown systems, Information and Computation, vol.209, issue.5, pp.799-821, 2010.
DOI : 10.1016/j.ic.2010.12.004

A. Kartzow and P. , Parys Strictness of the Collapsible Pushdown Hierarchy, p.2012

T. Knapik, D. Niwinski, and P. Urzyczyn, Higher-Order Pushdown Trees Are Easy, FoSSaCS, pp.205-222, 2002.
DOI : 10.1007/3-540-45931-6_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5773

T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz, Unsafe Grammars and Panic Automata, ICALP, pp.1450-1461, 2005.
DOI : 10.1007/11523468_117
URL : https://hal.archives-ouvertes.fr/hal-00335729

N. Kobayashi, Higher-Order Model Checking: From Theory to Practice, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.219-224, 2011.
DOI : 10.1109/LICS.2011.15

N. Kobayashi, A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes, FoSSaCS, pp.260-274, 2011.
DOI : 10.1007/978-3-642-19805-2_18

C. L. Ong, On Model-Checking Trees Generated by Higher-Order Recursion Schemes, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.81-90, 2006.
DOI : 10.1109/LICS.2006.38

C. L. Ong and S. J. Ramsay, Verifying higher-order functional programs with pattern-matching algebraic data types, POPL, pp.587-598, 2011.
DOI : 10.1145/1925844.1926453

P. Parys, Collapse operation increases expressive power of deterministic higher order pushdown automata, STACS, pp.603-614, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573593

T. W. Reps, S. Schwoon, S. Jha, and D. Melski, Weighted pushdown systems and their application to interprocedural dataflow analysis, Science of Computer Programming, vol.58, issue.1-2, pp.206-263, 2005.
DOI : 10.1016/j.scico.2005.02.009

S. Salvati and I. Walukiewicz, Krivine machines and higher-order schemes, pp.162-173, 2011.
DOI : 10.1007/978-3-642-22012-8_12
URL : https://hal.archives-ouvertes.fr/hal-01121744

S. Schwoon, Model-checking Pushdown Systems, 2002.

A. Seth, AN ALTERNATIVE CONSTRUCTION IN SYMBOLIC REACHABILITY ANALYSIS OF SECOND ORDER PUSHDOWN SYSTEMS, International Journal of Foundations of Computer Science, vol.19, issue.04, pp.80-95, 2007.
DOI : 10.1142/S012905410800608X

A. Seth, Games on Higher Order Multi-stack Pushdown Systems, In RP, vol.15, issue.1-2, pp.203-216, 2009.
DOI : 10.1016/S0019-9958(86)80016-X

D. Suwimonteerabuth, J. Esparza, and S. Schwoon, Symbolic Context-Bounded Analysis of Multithreaded Java Programs, SPIN, pp.270-287, 2008.
DOI : 10.1007/978-3-540-85114-1_19

D. Suwimonteerabuth, S. Schwoon, and J. Esparza, Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains, ATVA, pp.141-153, 2006.
DOI : 10.1007/11901914_13