P. A. Abdulla, G. Delzanno, N. B. Henda, and A. Rezine, Regular model checking without transducers, TACAS, 2007.
DOI : 10.1007/s10009-011-0216-8

P. A. Abdulla, G. Delzanno, and A. Rezine, Parameterized Verification of Infinite-State Processes with Global Conditions, 2007.
DOI : 10.1007/978-3-540-73368-3_17

P. A. Abdulla, F. Haziza, and L. Holík, All for the Price of Few, VMCAI, pp.476-495, 2013.
DOI : 10.1007/978-3-642-35873-9_28

F. Alberti, S. Ghilardi, E. Pagani, S. Ranise, and G. P. Rossi, Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study, p.35, 2010.
DOI : 10.1007/978-3-642-15763-9_36

K. R. Apt and D. C. Kozen, Limits for automatic verification of finite-state concurrent systems, Information Processing Letters, vol.22, issue.6, pp.307-309, 1986.
DOI : 10.1016/0020-0190(86)90071-2

T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. D. Zuck, Parameterized Verification with Automatically Computed Inductive Assertions?, CAV, pp.221-234, 2001.
DOI : 10.1007/3-540-44585-4_19

K. Baukus, Y. Lakhnech, and K. Stahl, Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness, VMCAI, pp.317-330, 2002.
DOI : 10.1007/3-540-47813-2_22

T. D. Chandra and S. Toueg, Time and message efficient reliable broadcasts, Distributed algorithms, pp.289-303, 1991.
DOI : 10.1007/3-540-54099-7_20

C. Chou, P. K. Mannava, and S. Park, A Simple Method for Parameterized Verification of Cache Coherence Protocols, FMCAD, pp.382-398, 2004.
DOI : 10.1007/978-3-540-30494-4_27

E. Clarke, D. Long, K. Mcmillan, E. Clarke, M. Talupur et al., Compositional model checking Environment abstraction for parameterized verification, LICS VMCAI, pp.353-362, 1989.

E. M. Clarke, O. Grumberg, and M. C. Browne, Reasoning about networks with many identical finite-state processes, Proceedings of the fifth annual ACM symposium on Principles of distributed computing , PODC '86
DOI : 10.1145/10590.10611
URL : http://dx.doi.org/10.1016/0890-5401(89)90026-6

A. Cohen and K. S. Namjoshi, Local proofs for global safety properties, Formal Methods in System Design, vol.19, issue.5, pp.104-125, 2009.
DOI : 10.1007/s10703-008-0063-8

S. Conchon, A. Goel, S. Krsti´ckrsti´c, A. Mebsout, and F. Za¨?diza¨?di, Cubicle: A Parallel SMT-Based Model Checker for Parameterized Systems, CAV, pp.718-724, 2012.
DOI : 10.1007/978-3-642-31424-7_55
URL : https://hal.archives-ouvertes.fr/hal-00799272

S. Das, D. L. Dill, and S. Park, Experience with Predicate Abstraction, CAV, pp.160-171, 1999.
DOI : 10.1007/3-540-48683-6_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.3860

E. A. Emerson and K. S. Namjoshi, On model checking for nondeterministic infinite-state systems, LICS, pp.70-80, 1998.

M. Emmi, R. Majumdar, and R. Manevich, Parameterized verification of transactional memories, PLDI, pp.134-145, 2010.

S. M. German and A. P. Sistla, Reasoning about systems with many processes, Journal of the ACM, vol.39, issue.3, pp.675-735, 1992.
DOI : 10.1145/146637.146681

S. Ghilardi and S. Ranise, Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis, Logical Methods in Computer Science, vol.6, issue.4, 2010.
DOI : 10.2168/LMCS-6(4:10)2010

S. Ghilardi and S. Ranise, MCMT: A Model Checker Modulo Theories, IJCAR, pp.22-29, 2010.
DOI : 10.1007/978-3-642-14203-1_3

O. Grinchtein, M. Leucker, and N. Piterman, Inferring Network Invariants Automatically, IJCAR, pp.483-497, 2006.
DOI : 10.1007/11814771_40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.3152

O. Grumberg and H. Veith, 25 Years of Model Checking: History , Achievements, Perspectives, 2008.
DOI : 10.1007/978-3-540-69850-0

N. B. Henda and A. Rezine, The PFS prototype model checker

G. J. Holzmann, Design and validation of computer protocols, 1991.

A. Kaiser, D. Kroening, and T. Wahl, Dynamic Cutoff Detection in Parameterized Concurrent Programs, CAV, pp.645-659, 2010.
DOI : 10.1007/978-3-642-14295-6_55

S. Krsti´ckrsti´c, Parametrized system verification with guard strengthening and parameter abstraction, AVIS, 2005.

J. Kuskin, D. Ofelt, M. Heinrich, J. Heinlein, R. Simoni et al., The Stanford FLASH multiprocessor, ISCA, pp.302-313, 1994.

S. K. Lahiri and R. E. Bryant, Constructing Quantified Invariants via Predicate Abstraction, VMCAI, pp.267-281, 2004.
DOI : 10.1007/978-3-540-24622-0_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.6771

S. K. Lahiri and R. E. Bryant, Indexed Predicate Discovery for Unbounded System Verification, CAV, pp.135-147, 2004.
DOI : 10.1007/978-3-540-27813-9_11

K. L. Mcmillan, Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking, CHARME, pp.179-195, 2001.
DOI : 10.1007/3-540-44798-9_17

K. L. Mcmillan, Quantified Invariant Generation Using an Interpolating Saturation Prover, TACAS, pp.413-427, 2008.
DOI : 10.1007/978-3-540-78800-3_31

K. S. Namjoshi, Symmetry and Completeness in the Analysis of Parameterized Systems, VMCAI, pp.299-313, 2007.
DOI : 10.1007/978-3-540-69738-1_22

J. W. O-'leary, M. Talupur, and M. R. Tuttle, Protocol verification using flows: An industrial experience, 2009.

S. Park and D. L. Dill, Protocol verification by aggregation of distributed transactions, CAV, pp.300-310, 1996.
DOI : 10.1007/3-540-61474-5_78

G. D. Penna, B. Intrigila, I. Melatti, E. Tronci, and M. V. Zilli, Exploiting transition locality in automatic verification of finite-state concurrent systems, International Journal on Software Tools for Technology Transfer, vol.2, issue.4, pp.320-341, 2004.
DOI : 10.1007/s10009-004-0149-6

A. Pnueli, S. Ruah, and L. D. Zuck, Automatic Deductive Verification with Invisible Invariants, TACAS, pp.82-97, 2001.
DOI : 10.1007/3-540-45319-9_7

M. Talupur and M. R. Tuttle, Going with the Flow: Parameterized Verification Using Message Flows, 2008 Formal Methods in Computer-Aided Design, pp.1-8, 2008.
DOI : 10.1109/FMCAD.2008.ECP.14