P. Abdulla, Y. F. Chen, L. Holik, R. Mayr, and T. Vojnar, When simulation meets antichains, Proc. of TACAS'10, vol.6015, pp.158-174, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00460294

R. Alur and D. L. Dill, A theory of timed automata, Theor. Comput. Sci, vol.126, issue.2, pp.183-235, 1994.

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, Fast: Fast acceleration of symbolic transition systems, Proc. of CAV'03, vol.2725, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00084185

T. A. Beyene, C. Popeea, and A. Rybalchenko, Solving existentially quantified horn clauses, Proc. of CAV'13, vol.8044, 2013.

N. Bjørner, A. Gurfinkel, K. Mcmillan, and A. Rybalchenko, Horn Clause Solvers for Program Verification, pp.24-51, 2015.

M. Boja?czyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data words, ACM Trans. Comput. Logic, vol.12, issue.4, pp.1-27, 2011.

F. Bonchi and D. Pous, Checking nfa equivalence with bisimulations up to congruence, Proc. of POPL'13, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00639716

M. Bozga, P. Habermehl, R. Iosif, F. Konecný, and T. Vojnar, Automatic verification of integer array programs, Proc. of CAV'09, vol.5643, pp.157-172, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00558070

A. Cimatti, A. Griggio, B. Schaafsma, and R. Sebastiani, The MathSAT5 SMT Solver, Proc. of TACAS, vol.7795, 2013.

B. Cook, H. Khlaaf, and N. Piterman, On automation of ctl* verification for infinite-state systems, Proc. of CAV'15, vol.9206, 2015.

W. Craig, Three uses of the herbrand-gentzen theorem in relating model theory and proof theory, J. Symb. Log, vol.22, issue.3, pp.269-285, 1957.

L. D'antoni and R. Alur, Symbolic visibly pushdown automata, Proc. of CAV'14, vol.8559, 2014.

N. Decker, P. Habermehl, M. Leucker, and D. Thoma, Ordered navigation on multi-attributed data words, Proc. of CONCUR'14, vol.8704, pp.497-511, 2014.

A. Dhar, Algorithms for model-checking flat counter systems, vol.7, 2014.

L. Fribourg, A closed-form evaluation for extended timed automata, 1998.

S. Grebenshchikov, N. P. Lopes, C. Popeea, and A. Rybalchenko, Synthesizing software verifiers from proof rules, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '12, pp.405-416, 2012.

P. Habermehl, R. Iosif, and T. Vojnar, A logic of singly indexed arrays, Proc. of LPAR'08, vol.5330, pp.558-573, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01418915

P. Habermehl, R. Iosif, and T. Vojnar, What else is decidable about integer arrays?, Proc. of FOS-SACS'08, vol.4962, pp.474-489, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01418914

T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, Lazy abstraction, Proc. of POPL'02, 2002.

T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, Software Verification with Blast, Proc. of 10th SPIN Workshop, vol.2648, 2003.

T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic model checking for real-time systems, Information and Computation, vol.111, pp.394-406, 1992.

R. Iosif, A. Rogalewicz, and T. Vojnar, Abstraction refinement and antichains for trace inclusion of infinite state systems, Proc. of TACAS'16, vol.9636, pp.71-89, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01418885

R. Iosif and X. Xu, Abstraction refinement for emptiness checking of alternating data automata, Proc. TACAS'18, vol.10806, pp.93-111, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02388034

M. Kaminski and N. Francez, Finite-memory automata, Theoretical Computer Science, vol.134, issue.2, pp.90242-90251, 1994.

K. L. Mcmillan, Lazy abstraction with interpolants, Proc. of CAV'06, vol.4144, 2006.

K. L. Mcmillan, Interpolants from z3 proofs, Proceedings of the International Conference on Formal Methods in Computer-Aided Design, pp.19-27, 2011.

R. Milner, An algebraic definition of simulation between programs, Proc. of IJCAI'71, 1971.

M. Minsky, Computation: Finite and Infinite Machines, 1967.

, Numerical Transition Systems Repository, 2012.

J. Ouaknine and J. Worrell, On the language inclusion problem for timed automata: Closing a decidability gap, Proc of LICS'04, 2004.

A. Smrcka and T. Vojnar, Verifying parametrised hardware designs via counter automata, HVC'07, pp.51-68, 2007.