A. Armando, R. Carbone, and L. Compagna, Ltl model checking for security protocols, Applied NonClassical Logics, vol.19, issue.4, pp.403-429, 2009.

A. Armando, The AVISPA tool for the automated validation of Internet security protocols and applications, Proceedings of Computer Aided Verification (CAV), vol.3576, pp.281-285, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000408

M. Backes and D. Unruh, Limits of constructive security proofs, Theory and Application of Cryptology and Information Security (ASIACRYPT), vol.5350, pp.290-307, 2008.

J. Barnat, L. Brim, and I. Cëerná, Property driven distribution of nested dfs, Workshop on Verification and Computational Logic (VCL), pp.1-10, 2002.

J. Barnat, J. Chaloupka, and J. V. Pol, Distributed Algorithms for SCC Decomposition, Journal of Logic and Computation, vol.21, issue.1, pp.23-44, 2011.

D. Basin, C. Cremers, and C. Meadows, Model Checking Security Protocols, chap, vol.24, 2011.

G. Bhat, R. Cleaveland, and O. Grumberg, Efficient on-the-fly model checking for ctl*, Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS), pp.388-398, 1995.

R. H. Bisseling, Parallel Scientific Computation. A structured approach using BSP and MPI, 2004.

B. Blanchet, An efficient cryptographic protocol verifier based on Prolog rules, IEEE CSFW'01, 2001.

S. Blom, B. Lisser, J. Van-de-pol, and M. Weber, A database approach to distributed state-space generation, J. Log. Comput, vol.21, issue.1, pp.45-62, 2011.

M. C. Boukala and L. Petrucci, Distributed model-checking and counterexample search for ctl logic, pp.44-59, 2012.

A. D. Brucker and S. Mödersheim, Integrating automated and interactive protocol verification, Formal Aspects in Security and Trust (FAST), vol.5983, pp.248-262, 2009.

S. Chaou, G. Utard, and F. Pommereau, Evaluating a peer-to-peer storage system in presence of malicious peers, High Performance Computing and Simulation (HPCS), pp.419-426, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00669179

S. Christensen, L. M. Kristensen, and T. Mailund, A sweep-line method for state space exploration, Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS), vol.2031, pp.450-464, 2001.

G. Ciardo, J. Gluckman, and D. M. Nicol, Distributed state space generation of discrete-state stochastic models, INFORMS Journal on Computing, vol.10, issue.1, pp.82-93, 1998.

H. Comon-lundh and V. Cortier, How to prove security of communication protocols? a discussion on the soundness of formal models w.r.t. computational ones, STACS, pp.29-44, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573590

V. Cortier, J. Degrieck, and S. Delaune, Analysing routing protocols: Four nodes topologies are sufficient, Principles of Security and Trust (POST), vol.7215, pp.30-50, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00732911

C. J. Cremers, Scyther -semantics and verification of security protocols, 2006.

J. F. Cremers, P. Lafourcade, and P. Nadeau, Comparing state spaces in automatic security protocol analysis, Formal to Practical Security, vol.5458, pp.70-94, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01759940

D. Dolev and A. C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory, vol.29, issue.2, pp.198-208, 1983.

S. Evangelista and L. M. Kristensen, Hybrid on-the-fly ltl model checking with the sweep-line method, Application and Theory of Petri Nets, vol.7347, pp.248-267, 2012.

J. Ezekiel and G. Lüttgen, Measuring and evaluating parallel state-space exploration algorithms, Electr. Notes Theor. Comput. Sci, vol.198, issue.1, pp.47-61, 2008.

W. Fokkink, M. T. Dashti, and A. Wijs, Partial order reduction for branching security protocols, Conference on Application of Concurrency to System Design (ACSD), pp.191-200, 2010.

H. Garavel, R. Mateescu, and I. M. Smarandache, Parallel state space construction for model-checking, Proceedings of SPIN, vol.2057, pp.217-234, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072247

V. Goranko, A. Kyrilov, and D. Shkatov, Tableau tool for testing satisfiability in ltl: Implementation and experimental analysis, Electr. Notes Theor. Comput. Sci, vol.262, pp.113-125, 2010.

M. Guedj, Bsp algorithms for ltl & ctl* model checking of security protocols, 2012.

K. Hinsen, Parallel scripting with Python, Computing in Science & Engineering, vol.9, issue.6, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00282403

G. Holzmann, D. Peled, and M. Yannakakis, On nested depth first search (extended abstract). In: The Spin Verification System, pp.23-32, 1996.

C. Inggs, H. Barringer, A. Nenadic, and N. Zhang, Model checking a security protocol, Southern African Telecommunications Network and Applications Conference (SATNAC), 2004.

C. P. Inggs and H. Barringer, Ctl * model checking on a shared-memory architecture, Formal Methods in System Design, vol.29, issue.2, pp.135-155, 2006.

A. Iosup, O. Sonmez, S. Anoep, and D. Epema, The performance of bags-of-tasks in large-scale distributed systems, Symposium on High performance distributed computing (HPDC), pp.97-108, 2008.

S. Kremer, O. Markowitch, and J. Zhou, An intensive survey of fair non-repudiation protocols, Computer Communications, vol.25, issue.17, pp.1606-1621, 2002.

R. Kumar and E. G. Mercer, Load balancing parallel explicit state model checking, In: ENTCS, vol.128, pp.19-34, 2005.

F. Lerda and R. Sista, Distributed-memory model checking with SPIN, Proceedings of SPIN, no. 1680 in LNCS, pp.22-39, 1999.

M. Leucker, R. Somla, and M. Weber, Parallel model checking for ltl, ctl*, and l, Electr. Notes Theor. Comput. Sci. pp, pp.1-1, 2003.

G. Lowe, Breaking and fixing the needham-schroeder public-key protocol using fdr, Tools and Algorithms for Construction and Analysis of Systems (TACAS), vol.1055, pp.147-166, 1996.

P. Maggi and R. Sisto, Using spin to verify security properties of cryptographic protocols, Model Checking of Software (SPIN), vol.2318, pp.187-204, 2002.

J. C. Mitchell, M. Mitchell, and U. Stern, Automated analysis of cryptographic protocols using murphi, IEEE Symposium on Security and Privacy, pp.141-151, 1997.

S. Orzan, J. Van-de-pol, and M. Espada, A state space distributed policy based on abstract interpretation, vol.128, pp.35-45, 2005.

L. C. Paulson, The inductive approach to verifying cryptographic protocols, Journal of Computer Security, vol.6, issue.1-2, pp.85-128, 1998.

D. Petcu, Parallel explicit state reachability analysis and state space construction, Proceedings of ISPDC, pp.207-214, 2003.

F. Pommereau, Algebras of coloured Petri nets, 2010.

U. Stern and D. L. Dill, Parallelizing the murj verifier, Formal Methods in System Design, vol.18, issue.2, pp.117-129, 2001.