J. Tretmans, Test generation with inputs, outputs and repetitive quiescence, Software? Concepts and Tools, vol.17, issue.3, 1996.
DOI : 10.1007/3-540-61042-1_42

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.9528

C. Jard and T. Jéron, TGV: theory, principles and algorithms, International Journal on Software Tools for Technology Transfer, vol.17, issue.4, 2004.
DOI : 10.1007/s10009-004-0153-x

B. Jeannet, T. Jéron, V. Rusu, and E. Zinovieva, Symbolic Test Selection Based on Approximate Analysis, TACAS'05, 2005.
DOI : 10.1007/978-3-540-31980-1_23

URL : https://hal.archives-ouvertes.fr/inria-00564617

T. Ball and S. Rajamani, Bebop: A Symbolic Model Checker for Boolean Programs, LNCS, vol.1885, 2000.
DOI : 10.1007/10722468_7

J. Esparza and S. Schwoon, A BDD-Based Model Checker for Recursive Programs, Computer Aided Verification, CAV'01, 2001.
DOI : 10.1007/3-540-44585-4_30

D. Caucal, On the regular structure of prefix rewriting, Theoretical Computer Science, vol.106, 1992.

A. Finkel, B. Willems, and P. Wolper, A direct symbolic approach to model checking pushdown systems, Electronic Notes on Theoretical Computer Science, vol.9, 1997.

A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking, Int. Conf. on Concurrency Theory, CONCUR'97, 1997.
DOI : 10.1007/3-540-63141-0_10