A. Sy, 102) (30) 1.46 (30) 0.34 (100) 39, pp.37300-37301, 0200.

A. Offutt, Y. Xiong, and S. Liu, Criteria for Generating Specification-Based Tests. ICECSS'99, Proceedings of the 5th International Conference on Engineering of Complex Computer Systems, pp.119-129, 1999.

A. Groce and R. Joshi, Random testing and model checking, Proceedings of the 2008 international workshop on dynamic analysis held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2008), WODA '08, pp.22-28, 2008.
DOI : 10.1145/1401827.1401833

A. Denise, M. Gaudel, S. Gouraud, R. Lassaigne, J. Oudinet et al., Coverage-biased random exploration of large models and application to testing, International Journal on Software Tools for Technology Transfer, vol.24, issue.7, pp.73-93, 2012.
DOI : 10.1007/s10009-011-0190-1
URL : https://hal.archives-ouvertes.fr/inria-00560621

F. Song and T. Touili, PuMoC: a CTL model-checker for sequential programs, Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering, ASE 2012, pp.346-349, 2012.
DOI : 10.1145/2351676.2351743

M. Sipser, Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 1996.
DOI : 10.1145/230514.571645

Y. Ponty, M. Termier, and D. A. , GenRGenS: software for generating random genomic sequences and structures, Bioinformatics, vol.22, issue.12, pp.1534-1535, 2006.
DOI : 10.1093/bioinformatics/btl113
URL : https://hal.archives-ouvertes.fr/inria-00548871

A. Denise, I. Dutour, and P. Zimmermann, Cs: a mupad package for counting and randomly generating combinatorial structures. FPSAC'98, pp.195-204, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00107518

A. Gotlieb, B. Botella, and M. Rueher, Automatic test data generation using constraint solving techniques, ISSTA'98: Proceeding of the International Symposium on Software Testing and Analysis, pp.53-62, 1998.
DOI : 10.1145/271771.271790

A. Gotlieb, T. Denmat, and B. Botella, Constraint-based test data generation in the presence of stack-directed pointers, Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering , ASE '05, pp.313-316, 2005.
DOI : 10.1145/1101908.1101958

P. Godefroid, N. Klarlund, and K. Sen, DART: directed automated random testing, PLDI'05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, pp.213-223, 2005.

N. Williams, B. Marre, P. Mouy, and R. M. Pathcrawler, PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis, EDCC, Lecture Notes in Computer Science, vol.3463, pp.281-292, 2005.
DOI : 10.1007/11408901_21

D. Lee and M. Yannakakis, Principles and methods of testing finite state machines-a survey, Proceedings of the IEEE, vol.84, issue.8, pp.1090-1123, 1996.
DOI : 10.1109/5.533956

C. Campbell, W. Grieskamp, L. Nachmanson, W. Schulte, N. Tillmann et al., Testing Concurrent Object-Oriented Systems with Spec Explorer, FM'05: Proceeding of Formal Methods Europe, pp.542-547, 2005.
DOI : 10.1007/11526841_38

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

P. Ammann and J. Offutt, Introduction to Software Testing, 2008.
DOI : 10.1017/CBO9780511809163

P. Purdom, A sentence generator for testing parsers, BIT, vol.9, issue.1, pp.366-375, 1972.
DOI : 10.1007/BF01932308

B. Daniel, D. Dig, K. Garcia, and D. Marinov, Automated testing of refactoring engines, Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering , ESEC-FSE '07, 2007.
DOI : 10.1145/1287624.1287651

D. Coppit and J. Lian, yagg, Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering , ASE '05, pp.356-359, 2005.
DOI : 10.1145/1101908.1101969

R. Lämmel and W. Schulte, Controllable combinatorial coverage in grammarbased testing, TestCom'06: Proccedings of the 18th IFIP TC6

R. Majumdar and R. Xu, Directed test generation using symbolic grammars, Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering, pp.134-143, 2007.
DOI : 10.1145/1321631.1321653
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.4430

P. Godefroid, A. Kiezun, and M. Levin, Grammar-based whitebox fuzzing, PLDI'08: Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, pp.206-215, 2008.
DOI : 10.1145/1379022.1375607
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.770

Z. Xu, L. Zheng, and H. Chen, A toolkit for generating sentences from contextfree grammars. Software Engineering and Formal Methods, IEEE, pp.118-122, 2010.

R. Lämmel, . Grammar, and . Testing, Grammar Testing, Proceedings of 4th International Conference on Fundamental Approaches to Software Engineering, pp.201-216, 2001.
DOI : 10.1007/3-540-45314-8_15

L. Zheng and D. Wu, A Sentence Generation Algorithm for Testing Grammars, 2009 33rd Annual IEEE International Computer Software and Applications Conference, pp.130-135, 2009.
DOI : 10.1109/COMPSAC.2009.193

T. Alves and J. Visser, A Case Study in Grammar Engineering, SLE'08: Proceedings of the First International Conference on Software Language Engineering, pp.285-304, 2008.
DOI : 10.1007/3-540-45937-5_12

J. Duran and S. Ntafos, A report on random testing, Proceedings of the 5th international conference on Software engineering, pp.179-183, 1981.

R. Hamlet, Random testing. Encyclopedia of Software Engineering, pp.970-978, 1994.

C. Oriat and . Jartege, Jartege: A Tool for Random Generation of Unit Tests for Java Classes, QoSA/SOQUA'05: Proceeding of the First International Conference on the Quality of Software Architectures, pp.242-256, 2005.
DOI : 10.1007/11558569_18
URL : https://hal.archives-ouvertes.fr/hal-00003466

B. Mckenzie, Generating string at random from a context-free grammar, 1997.

T. Hickey and J. Cohen, Uniform Random Generation of Strings in a Context-Free Language, SIAM Journal on Computing, vol.12, issue.4, pp.645-655, 1983.
DOI : 10.1137/0212044

P. Maurer, The design and implementation of a grammar-based data generator . Software: Practice and Experience 1992, pp.223-244

P. Héam and C. Nicaud, Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing, 2011 Fourth IEEE International Conference on Software Testing, Verification and Validation, pp.60-69, 2011.
DOI : 10.1109/ICST.2011.31

F. Dadeau, J. Levrey, and P. Héam, On the Use of Uniform Random Generation of Automata for Testing, Electronic Notes in Theoretical Computer Science, vol.253, issue.2, pp.37-51, 2009.
DOI : 10.1016/j.entcs.2009.09.050
URL : https://hal.archives-ouvertes.fr/inria-00429236

P. Flajolet, P. Zimmermann, and B. Cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2008.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

S. Schwoon, Model-checking pushdown systems, 2002.

M. Berkelaar, K. Notebaert, and P. , lp_solve: a mixed interger linear program, 2004.

R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757

R. Clark, Querying streaming xml using visibly pushdown automata, 2008.

M. Hague and C. Ong, Analysing Mu-Calculus Properties of Pushdown Systems, Lecture Notes in Computer Science, vol.6349, pp.187-192, 2010.
DOI : 10.1007/978-3-642-16164-3_14

F. Song and T. Touili, Efficient CTL Model-Checking for Pushdown Systems, CONCUR'11: Proceedings of the 22nd International Conference on Concurrency Theory, pp.434-449, 2011.
DOI : 10.1007/3-540-44450-5_10

A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith et al., An efficient automata approach to some problems on context-free grammars, Information Processing Letters, vol.74, issue.5-6, pp.5-6221, 2000.
DOI : 10.1016/S0020-0190(00)00055-7

S. Basu, D. Saha, Y. Lin, and S. Smolka, Generation of All Counter-Examples for Push-Down Systems, FORTE'03: Proccedings of the 23rd IFIP WG 6
DOI : 10.1007/3-540-58950-3_371