P. Godefroid, N. Klarlund, and K. Sen, DART: directed automated random testing, Proc. of PLDI'05, pp.213-223, 2005.

N. Williams, B. Marre, P. Mouy, and M. Roger, PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis, Proc. Dependable Computing -EDCC'05, pp.281-292, 2005.
DOI : 10.1007/11408901_21

K. Sen, D. Marinov, and G. Agha, CUTE: a concolic unit testing engine for c, Proc. of ESEC/FSE-13, pp.263-272, 2005.

N. Tillmann and J. De-halleux, Pex???White Box Test Generation for .NET, Proc. of the 2nd Int. Conf. on Tests and Proofs, ser, pp.134-153, 2008.
DOI : 10.1007/978-3-540-79124-9_10

E. J. Weyuker, The applicability of program schema results to programs, International Journal of Computer & Information Sciences, vol.4, issue.5, pp.387-403, 1979.
DOI : 10.1007/BF00995175

D. Yates and N. Malevris, Reducing the effects of infeasible paths in branch testing, TAV3: Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification, pp.48-54, 1989.

M. N. Ngo and H. B. Tan, Heuristics-based infeasible path detection for dynamic test data generation, Information and Software Technology, vol.50, issue.7-8, pp.641-655, 2008.
DOI : 10.1016/j.infsof.2007.06.006

D. Moura and N. Bjørner, Z3: An Efficient SMT Solver, Lecture Notes in Computer Science, vol.4963, pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

N. Jussien, R. Debruyne, and P. Boizumault, Maintaining Arc-Consistency within Dynamic Backtracking, Principles and Practice of Constraint Programming ser, pp.249-261, 2000.
DOI : 10.1007/3-540-45349-0_19
URL : https://hal.archives-ouvertes.fr/hal-00869126

U. Junker, QuickXplain: Conflict detection for arbitrary constraint propagation algorithms, IJCAI'01 Workshop on Modelling and Solving problems with constraints (CONS-1), 2001.

C. Meudec, ATGen: automatic test data generation using constraint logic programming and symbolic execution, Software Testing, Verification and Reliability, vol.33, issue.2, pp.81-96, 2001.
DOI : 10.1002/stvr.225

S. Bardin and P. Herrmann, Structural Testing of Executables, 2008 International Conference on Software Testing, Verification, and Validation, pp.22-31, 2008.
DOI : 10.1109/ICST.2008.8

B. Marre and A. Arnould, Test sequences generation from LUSTRE descriptions: GATEL, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering, 2000.
DOI : 10.1109/ASE.2000.873667

H. Do, S. G. Elbaum, and G. , Supporting Controlled Experimentation with Testing Techniques: An Infrastructure and its Potential Impact, Empirical Software Engineering, vol.28, issue.1, pp.405-435, 2005.
DOI : 10.1007/s10664-005-3861-2

L. Zhang and S. Malik, Extracting small unsatisfiable cores from unsatisfiable boolean formulas, 2003.

A. Cimatti, A. Griggio, and R. Sebastiani, A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories, SAT'07, p.334, 2007.
DOI : 10.1007/978-3-540-72788-0_32

M. N. Ngo and H. B. Tan, Detecting large number of infeasible paths through recognizing their patterns, 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, pp.215-224, 2007.
DOI : 10.1145/1287624.1287655