U. , D. , B. R. Alur, R. K. Brayton, T. A. Henzinger et al., Partialorder reduction in symbolic state-space exploration, CAV, pp.340-351, 1997.

M. Ben-ari, A. Pnueli, and Z. Manna, The temporal logic of branching time, Acta Informatica, vol.20, issue.4, pp.207-226, 1983.
DOI : 10.1007/BF01257083

M. Ben-or, Another advantage of free choice : Completely asynchronous agreement protocols, ACM SIGACT-SIGOPS symposium on PODC, pp.27-30, 1983.

A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, Symbolic model checking using sat procedures instead of bdds, DAC, pp.317-320, 1999.

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, TACAS, pp.193-207, 1999.
DOI : 10.1007/3-540-49059-0_14

M. Bozga, J. C. Fernandez, L. Ghirvu, S. Graf, J. P. Krimm et al., IF: A Validation Environment for Timed Asynchronous Systems, In CAV LNCS, pp.543-547, 2000.
DOI : 10.1007/10722167_41
URL : https://hal.archives-ouvertes.fr/hal-00369415

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.4027

R. E. Bryant, On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication, IEEE Transactions on Computers, vol.40, issue.2, pp.20-213, 1991.
DOI : 10.1109/12.73590

R. E. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys, vol.24, issue.3, pp.293-318, 1992.
DOI : 10.1145/136035.136043

J. R. Burch, E. M. Clarke, K. L. Mcmillan, D. L. Dill, and L. J. Hwang, Symbolic model checking: 10/sup 20/ states and beyond, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.428-439, 1990.
DOI : 10.1109/LICS.1990.113767

H. Chockler, E. Farchi, B. Godlin, and S. Novikov, Cross-Entropy Based Testing, Formal Methods in Computer Aided Design (FMCAD'07), pp.101-108, 2007.
DOI : 10.1109/FAMCAD.2007.19

E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems, vol.8, issue.2, pp.244-263, 1986.
DOI : 10.1145/5397.5399

E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking, 1999.

E. M. Clarke, S. Jha, R. Enders, and T. Filkorn, Exploiting symmetry in temporal logic model checking, Formal Methods in System Design, vol.8, issue.Nos. 4/5, pp.77-104, 1996.
DOI : 10.1007/BF00625969

E. M. Clarke and I. A. Draghicescu, Expressivity results for linear-time and branching-time logics, Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, pp.428-437, 1988.

P. Dagum, R. Karp, M. Luby, and S. Ross, An optimal algorithm for monte carlo estimation, FOCS, pp.142-149, 1995.
DOI : 10.1109/sfcs.1995.492471
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5529

R. Drechsler and D. Gro?e, Reachability analysis for formal verification of system c, Euromicro Symposium on DSD, p.337, 2002.

S. Edelkamp, A. Lafuente, and S. Leue, Directed explicit model checking with HSF-SPIN, SPIN, LNCS, pp.57-79, 2001.
DOI : 10.1007/3-540-45139-0_5

E. A. Emerson, S. Jha, and D. Peled, Combining partial order and symmetry reductions, TACAS, pp.19-34, 1997.
DOI : 10.1007/BFb0035378

U. Feige, A tight lower bound on the cover time for random walks on graphs, Random Structures & Algorithms, vol.5, issue.1, pp.433-438, 1995.
DOI : 10.1002/rsa.3240060406

U. Feige, A tight upper bound on the cover time for random walks on graphs, Random Structures & Algorithms, vol.4, issue.1, pp.51-54, 1995.
DOI : 10.1002/rsa.3240060106

J. C. Fernandez, L. Mounier, C. Jard, and T. Jéron, On-the-fly verification of finite transition systems, Formal Methods in System Design, vol.2, issue.23, pp.251-273, 1992.
DOI : 10.1007/BF00121127
URL : https://hal.archives-ouvertes.fr/inria-00074812

C. Flanagan and P. Godefroid, Dynamic partial-order reduction for model checking software, ACM SIGPLAN-SIGACT Symposium on POPL, pp.110-121, 2005.

R. Fraer, G. Kamhi, B. Ziv, M. Y. Vardi, and L. Fix, Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification, pp.389-402, 2000.
DOI : 10.1007/10722167_30

J. Geldenhuys, State Caching Reconsidered, SPIN, LNCS, pp.23-38, 2004.
DOI : 10.1007/978-3-540-24732-6_3

P. Godefroid, Using partial orders to improve automatic verification methods, CAV, pp.176-185, 1990.
DOI : 10.1007/BFb0023731

P. Godefroid, On the costs and benefits of using partial-order methods for the verification of concurrent systems, In Partial Order Methods in Verification DIMACS, vol.29, pp.289-303, 1997.

]. P. Godefroid, G. J. Holzmann, and D. Pirottin, State-space caching revisited, CAV, LNCS, pp.178-191, 1992.
DOI : 10.1007/bf01384077
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.3630

P. Godefroid and S. Khurshid, Exploring very large state spaces using genetic algorithms, International Journal on Software Tools for Technology Transfer, vol.15, issue.2, pp.117-127, 2004.
DOI : 10.1007/s10009-004-0141-1

M. J. Gordon and T. F. Melham, Introduction to HOL : a theorem proving environment for higher order logic, 1993.

J. Goubault, Démonstration automatique en logique classique : complexité et méthodes, 1993.

R. Grosu, X. Huang, S. A. Smolka, W. Tan, and S. Tripakis, Deep Random Search for Efficient Model Checking of Timed Automata, Monterey Workshop, pp.111-124, 2006.
DOI : 10.1007/978-3-540-77419-8_7

R. Grosu and S. A. Smolka, Quantitative model checking, ISoLA, pp.165-174, 2004.

R. Grosu and S. A. Smolka, Monte Carlo Model Checking, TACAS, LNCS, pp.271-286, 2005.
DOI : 10.1007/978-3-540-31980-1_18

P. Haslum, Model checking by random walk, ECSEL Workshop, 1999.

C. A. Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969.
DOI : 10.1145/363235.363259

G. J. Holzmann, Tracing Protocols, AT&T Technical Journal, vol.64, issue.10, pp.2413-2433, 1985.
DOI : 10.1002/j.1538-7305.1985.tb00010.x

G. J. Holzmann, Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching, IEEE Transactions on Software Engineering, vol.13, issue.6, pp.683-696, 1987.
DOI : 10.1109/TSE.1987.233206

G. J. Holzmann, An analysis of bistate hashing, PSTV, volume 38 of IFIP Conference Proceedings, pp.301-314, 1995.

W. A. Howard and H. B. To, Curry : The formulae-as-types notion of construction. Essays on Combinatory Logic, Lambda Calculus, and Formalism, 1969.

G. Huet, G. Kahn, and C. Paulin-mohring, The coq proof assistant, a tutorial, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00069993

M. Huth and M. D. Ryan, Logic in computer science -Modelling and reasoning about systems, 1999.

C. Jard and T. Jéron, On-line model-checking for finite linear temporal logic specifications, Automatic Verification Methods for Finite State Systems, pp.189-196, 1989.
DOI : 10.1007/3-540-52148-8_16
URL : https://hal.archives-ouvertes.fr/inria-00075517

C. Jard and T. Jéron, Bounded-memory algorithms for verification on-the-fly, CAV, pp.192-202, 1991.
DOI : 10.1007/3-540-55179-4_19
URL : https://hal.archives-ouvertes.fr/inria-00075100

H. Kautz and B. Selman, Pushing the envelope : Planning, propositional logic and stochastic search, AAAI / IAAI, pp.1194-1201, 1996.

A. Kuehlmann, K. L. Mcmillan, and R. K. Brayton, Probabilistic state space search, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051), pp.574-579, 1999.
DOI : 10.1109/ICCAD.1999.810713
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.5295

O. Kupferman, M. Y. Vardi, and P. Wolper, An automata-theoretic approach to branching-time model checking, Journal of the ACM, vol.47, issue.2, pp.312-360, 2000.
DOI : 10.1145/333979.333987

D. Lehmann and M. O. Rabin, On the advantages of free choice : a symmetric and fully distributed solution to the dining philosophers problem, ACM SIGPLAN- SIGACT symposium on POPL, pp.133-138, 1981.

F. J. Lin, P. M. Chu, and M. T. Liu, Protocol verification using reachability analysis: the state space explosion problem and relief strategies, ACM SIGCOMM Computer Communication Review, vol.17, issue.5, pp.126-135, 1987.
DOI : 10.1145/55483.55496

A. Lluch-lafuente, S. Edelkamp, and S. Leue, Partial Order Reduction in Directed Model Checking, SPIN, LNCS, pp.112-127, 2002.
DOI : 10.1007/3-540-46017-9_10

M. Mihail and C. H. Papadimitriou, On the random walk method for protocol testing, CAV, pp.132-141, 1994.
DOI : 10.1007/3-540-58179-0_49

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

R. Nalumasu and G. Gopalakrishnan, An efficient partial order reduction algorithm with an alternative proviso implementation. Formal Methods in System Design, pp.231-247, 2002.

S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas, PVS: Combining specification, proof checking, and model checking, CAV, pp.411-414, 1996.
DOI : 10.1007/3-540-61474-5_91

R. Pelánek, Properties of state spaces and their applications, International Journal on Software Tools for Technology Transfer, vol.298, issue.5594, pp.443-454, 2008.
DOI : 10.1007/s10009-008-0070-5

]. R. Pelánek, T. Han?l, I. Cerná, and L. Brim, Enhancing random walk state space exploration, Proceedings of the 10th international workshop on Formal methods for industrial critical systems , FMICS '05, pp.98-105, 2005.
DOI : 10.1145/1081180.1081193

A. Pnueli, Linear and branching structures in the semantics and logics of reactive systems, Colloquium on Automata, Languages and Programming, pp.15-32, 1985.
DOI : 10.1007/BFb0015727

J. P. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

M. O. Rabin, S. Sankaranarayanan, R. Chang, G. Jiang, and F. Ivancic, Probabilistic algorithm for testing primality, ESEC-FSE, pp.128-138, 1980.
DOI : 10.1016/0022-314X(80)90084-0

A. P. Sistla and E. M. Clarke, The complexity of propositional linear temporal logics, Journal of the ACM, vol.32, issue.3, pp.733-749, 1985.
DOI : 10.1145/3828.3837

H. Sivaraj and G. Gopalakrishnan, Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking, Electronic Notes in Theoretical Computer Science, vol.89, issue.1, pp.51-67, 2003.
DOI : 10.1016/S1571-0661(05)80096-9

U. Stern and D. L. Dill, Improved probabilistic verification by hash compaction, CHARME, LNCS, pp.206-224, 1995.
DOI : 10.1007/3-540-60385-9_13

E. Tronci, G. D. Penna, B. Intrigila, and M. V. Zilli, A probabilistic approach to automatic verification of concurrent systems, Proceedings Eighth Asia-Pacific Software Engineering Conference, pp.317-324, 2001.
DOI : 10.1109/APSEC.2001.991495

M. Y. Vardi, An automata-theoretic approach to linear temporal logic, Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata, pp.238-266, 1996.
DOI : 10.1007/3-540-60915-6_6

C. H. West, Protocol validation by random state exploration, PSTV, pp.233-242, 1986.

P. Wolper and D. Leroy, Reliable hashing without collision detection, CAV, pp.59-70, 1993.
DOI : 10.1007/3-540-56922-7_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.3755

B. Yang, R. E. Bryant, D. R. O-'hallaron, A. Biere, O. Coudert et al., A Performance Study of BDD-Based Model Checking, FMCAD, pp.255-289, 1998.
DOI : 10.1007/3-540-49519-3_18

H. L. Younes and R. G. Simmons, Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling, CAV, pp.223-235, 2002.
DOI : 10.1007/3-540-45657-0_17