A. Abdulla, B. Bouajjani, M. Jonsson, and . Nilsson, On appelle une ?-théorie T un ensemble (potentiellement innni) de ?-structures. Ces structures sont aussi appelées les modèles de T Handling global conditions in parameterized system veriication, Proceedings of the 11th International Conference on Computer Aided Veriication, CAV '99, pp.134-145, 1999.

P. A. Abdulla, G. Delzanno, N. B. Henda, and A. Rezine, Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems), Tools and Algorithms for the Construction and Analysis of Systems, pp.721-736, 2007.
DOI : 10.1007/978-3-540-71209-1_56

P. A. Abdulla, G. Delzanno, and A. Rezine, Parameterized Verification of Infinite-State Processes with Global Conditions, Lecture Notes in Computer Science, vol.4590, pp.145-157, 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

P. A. Abdulla, N. Henda, G. Delzanno, and A. Rezine, Handling Parameterized Systems with Non-atomic Global Conditions, Veriication, Model Checking, and Abstract Interpretation, pp.22-36, 2008.
DOI : 10.1007/978-3-540-78163-9_7

P. A. Abdulla, K. ?er¯-ans, B. Jonsson, and Y. Tsay, General decidability theorems for innnite-state systems, LICS, pp.313-321, 1996.

F. Alberti, R. Bruttomesso, S. Ghilardi, S. Ranise, and N. Sharygina, Lazy Abstraction with Interpolants for Arrays, Logic for Programming, Artiicial Intelligence, and Reasoning, pp.46-61, 2012.
DOI : 10.1007/978-3-642-28717-6_7

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

F. Alberti, S. Ghilardi, E. Pagani, S. Ranise, and G. P. Rossi, Universal guards, relativization of quantiiers, and failure models in model checking modulo theories, JSAT, pp.29-61, 2012.

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

A. Armando, J. Mantovani, and L. Platania, Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers, Model Checking Software : 13th International SPIN Workshop Proceedings, p.146, 2006.
DOI : 10.1007/3-540-44829-2_17

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

T. Ball and S. K. Rajamani, Boolean programs : A model and process for software analysis, 2000.

J. Barnat, L. Brim, M. ?e?ka, and P. Ro?kai, DiVinE : Parallel Distributed Model Checker (Tool paper), HiBi/PDMC, pp.4-7, 2010.

K. Baukus, Y. Lakhnech, and K. Stahl, Parameterized veriication of a cache coherence protocol : Safety and liveness, VMCAI, pp.317-330, 2002.

S. Bevc and I. Savnik, Using tries for subset and superset queries, Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces, pp.147-152, 2009.
DOI : 10.1109/ITI.2009.5196071

D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, The software model checker Blast, International Journal on Software Tools for Technology Transfer, vol.2, issue.4, pp.505-525, 2007.
DOI : 10.1007/s10009-007-0044-z

A. Biere, A. Cimatti, E. M. Clarke, O. Strichman, and Y. Zhu, Bounded Model Checking, Advances in Computers, vol.58, pp.117-148, 2003.
DOI : 10.1016/S0065-2458(03)58003-2

S. Blazy, V. Laporte, A. Maroneze, and D. Pichardie, Formal Verification of a C Value Analysis Based on Abstract Interpretation, SAS, pp.324-344, 2013.
DOI : 10.1007/978-3-642-38856-9_18
URL : https://hal.archives-ouvertes.fr/hal-00812515

F. Bobot, S. Conchon, É. Contejean, M. Iguernelala, S. Lescuyer et al., The alt-ergo automated theorem prover, 2008.

A. Bouajjani, P. Habermehl, A. Rogalewicz, and T. Vojnar, Abstract regular (tree) model checking, International Journal on Software Tools for Technology Transfer, vol.24, issue.3, pp.167-191, 2012.
DOI : 10.1007/s10009-011-0205-y
URL : https://hal.archives-ouvertes.fr/hal-00156828

A. Bouajjani, P. Habermehl, and T. Vojnar, Abstract Regular Model Checking, Computer Aided Veriication, pp.372-386, 2004.
DOI : 10.1007/978-3-540-27813-9_29
URL : https://hal.archives-ouvertes.fr/hal-00159512

A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili, Regular Model Checking, Proceedings of the 12th International Conference on Computer Aided Veriication, CAV '00, pp.403-418, 2000.
DOI : 10.1007/10722167_31
URL : https://hal.archives-ouvertes.fr/hal-00159512

A. R. Bradley, SAT-Based Model Checking without Unrolling, Proceedings of the 12th International Conference on Veriication, Model Checking, and Abstract Interpretation, pp.70-87, 2011.
DOI : 10.1007/3-540-40922-X_8

G. Brat and W. Visser, Combining static analysis and model checking for software analysis, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), p.262, 2001.
DOI : 10.1109/ASE.2001.989812

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

R. E. Bryant, S. K. Lahiri, and S. A. Seshia, Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions, Proceedings of the 14th International Conference on Computer Aided Veriication, CAV '02, pp.78-92, 2002.
DOI : 10.1007/3-540-45657-0_7

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

T. D. Chandra and S. Toueg, Time and message eecient reliable broadcasts, Proceedings of the 4th International Workshop on Distributed Algorithms, pp.289-303, 1991.

X. Chen, Y. Yang, M. Delisi, G. Gopalakrishnan, and C. Chou, Hierarchical cache coherence protocol veriication one level at a time through assume guarantee, High Level Design Validation and Test Workshop, pp.107-114, 2007.

D. Chkliaev, J. Hooman, P. Van, and . Stok, Mechanical veriication of transaction processing systems, Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods, ICFEM '00, p.89, 2000.

C. Chou, P. K. Mannava, and S. Park, A simple method for parameterized veriication of cache coherence protocols, FMCAD, pp.382-398, 2004.

A. Cimatti and A. Griggio, Software Model Checking via IC3, Proceedings of the 24th International Conference on Computer Aided Veriication, CAV'12, pp.277-293, 2012.
DOI : 10.1007/978-3-642-31424-7_23

E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-Guided Abstraction Refinement, Lecture Notes in Computer Science, vol.1855, pp.154-169, 2000.
DOI : 10.1007/10722167_15

E. Clarke and R. Kurshan, Computer-aided veriication. Spectrum, IEEE, vol.33, issue.6, pp.61-67, 1996.

E. Clarke, D. Long, and K. Mcmillan, Compositional model checking, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.353-362, 1989.
DOI : 10.1109/LICS.1989.39190

E. M. Clarke and E. A. Emerson, Design and synthesis of synchronization skeletons using branching-time temporal logic, Logic of Programs, pp.52-71, 1982.

E. M. Clarke, O. Grumberg, and M. C. Browne, Reasoning about networks with many identical nite-state processes, Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC '86, pp.240-248, 1986.

E. M. Clarke, M. Talupur, and H. Veith, Environment Abstraction for Parameterized Verification, Lecture Notes in Computer Science, vol.3855, pp.126-141, 2006.
DOI : 10.1007/11609773_9

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, E. Contejean, J. Kanig, and S. Lescuyer, CC(X): Semantic Combination of Congruence Closure with Solvable Theories, Electronic Notes in Theoretical Computer Science, vol.198, issue.2, pp.51-69, 2008.
DOI : 10.1016/j.entcs.2008.04.080

S. Conchon, A. Goel, S. Krsti?, A. Mebsout, and F. Zaïdi, Cubicle: A Parallel SMT-Based Model Checker for Parameterized Systems, Lecture Notes in Computer Science, vol.7358, pp.718-724, 2012.
DOI : 10.1007/978-3-642-31424-7_55
URL : https://hal.archives-ouvertes.fr/hal-00799272

S. Conchon, A. Goel, S. Krsti?, A. Mebsout, and F. Zaïdi, Invariants for nite instances and beyond, FMCAD, pp.61-68, 2013.

S. Conchon, A. Mebsout, and F. Zaïdi, Vériication de systèmes paramétrés avec Cubicle, Vingt-quatrièmes Journées Francophones des Langages Applicatifs, 2013.

P. Cousot and R. Cousot, Abstract interpretation : a uniied lattice model for static analysis of programs by construction or approximation of xpoints, Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.238-252, 1977.

P. Cousot and R. Cousot, Abstract interpretation and application to logic programs, The Journal of Logic Programming, vol.13, issue.2-3, pp.103-179, 1992.
DOI : 10.1016/0743-1066(92)90030-7

W. Craig, Linear reasoning. A new form of the Herbrand-Gentzen theorem, The Journal of Symbolic Logic, vol.39, issue.03, pp.250-268, 1957.
DOI : 10.2307/2963593

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

M. Daumas and G. Melquiond, Certiication of bounds on expressions involving rounded operators, ACM Trans. Math. Softw, vol.372, issue.1, pp.1-220, 2010.

L. De-moura and N. Bjørner, Z3 : An eecient SMT solver Held as Part of the Joint European Conferences on Theory and Practice of Software, Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference Proceedings, volume 4963 of Lecture Notes in Computer Science, pp.337-340, 2008.

L. De-moura, H. Rueß, and M. Sorea, Bounded Model Checking and Induction: From Refutation to Verification, Lecture Notes in Computer Science, vol.2725, pp.14-26, 2003.
DOI : 10.1007/978-3-540-45069-6_2

L. E. Dickson, Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors, American Journal of Mathematics, vol.35, issue.4, pp.413-422, 1913.
DOI : 10.2307/2370405

E. W. Dijkstra, Cooperating sequential processes, technical report EWD-123, 1965.

D. L. Dill, The murphi veriication system, Proceedings of the 8th International Conference on Computer Aided Veriication, CAV '96, pp.390-393, 1996.

D. L. Dill, 25 years of model checking. chapter A Retrospective on Mur?, pp.77-88, 2008.

D. L. Dill, A. J. Drexler, A. J. Hu, and C. H. Yang, Protocol veriication as a hardware design aid, ICCD, pp.522-525, 1992.
DOI : 10.1109/iccd.1992.276232
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.9097

G. Dowek, A. Felty, H. Herbelin, G. Huet, B. Werner et al., The coq proof assistant user's guide : Version 5, 1991.

K. Dräger, A. Kupriyanov, B. Finkbeiner, and H. Wehrheim, SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems, Lecture Notes in Computer Science, vol.6015, pp.271-274, 2010.
DOI : 10.1007/978-3-642-12002-2_22

C. Dross, S. Conchon, J. Kanig, and A. Paskevich, Reasoning with triggers, SMT@IJCAR, pp.22-31, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00703207

B. Dutertre and L. De-moura, The Yices SMT solver, 2006.

E. A. Emerson and V. Kahlon, Exact and Efficient Verification of Parameterized Cache Coherence Protocols, Correct Hardware Design and Veriication Methods, pp.247-262, 2003.
DOI : 10.1007/978-3-540-39724-3_22

E. A. Emerson and K. S. Namjoshi, Automatic verification of parameterized synchronous systems, Lecture Notes in Computer Science, vol.1102, pp.87-98, 1996.
DOI : 10.1007/3-540-61474-5_60

E. A. Emerson and K. S. Namjoshi, On model checking for non-deterministic innnitestate systems, LICS, pp.70-80, 1998.

M. Emmi, R. Majumdar, and R. Manevich, Parameterized veriication of transactional memories, Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '10, pp.134-145, 2010.

J. Esparza, P. Lammich, R. Neumann, T. Nipkow, A. Schimpf et al., A Fully Verified Executable LTL Model Checker, Lecture Notes in Computer Science, vol.8044, pp.463-478, 2013.
DOI : 10.1007/978-3-642-39799-8_31
URL : https://hal.archives-ouvertes.fr/hal-01226469

J. Filliâtre and K. Kalyanasundaram, Functory: A Distributed Computing Library for Objective Caml, TFP, pp.65-81, 2011.
DOI : 10.1007/978-3-642-32037-8_5

J. Filliâtre and A. Paskevich, Why3 ??? Where Programs Meet Provers, Proceedings of the 22nd European Symposium on Programming, pp.125-128, 2013.
DOI : 10.1007/978-3-642-37036-6_8

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere ! Theor, Comput. Sci, vol.256, issue.12, pp.63-92, 2001.
DOI : 10.1016/s0304-3975(00)00102-x
URL : http://doi.org/10.1016/s0304-3975(00)00102-x

R. W. Floyd, Assigning meanings to programs, Program Veriication of Studies in Cognitive Systems, pp.65-81, 1993.
DOI : 10.1007/978-94-011-1793-7_4

P. Garoche, T. Kahsai, and C. Tinelli, Incremental Invariant Generation Using Logic-Based Automatic Abstract Transformers, NASA Formal Methods, pp.139-154, 2013.
DOI : 10.1007/978-3-642-38088-4_10

Y. Ge and L. Moura, Complete instantiation for quantiied formulas in satissabiliby modulo theories, Proceedings of the 21st International Conference on Computer Aided Veriication, CAV '09, pp.306-320, 2009.

S. Ghilardi, E. Nicolini, S. Ranise, and D. Zucchelli, Towards SMT Model Checking of Array-Based Systems, Lecture Notes in Computer Science, vol.5195, pp.67-82, 2008.
DOI : 10.1007/978-3-540-71070-7_6
URL : https://hal.archives-ouvertes.fr/inria-00576600

S. Ghilardi and S. Ranise, Goal-Directed Invariant Synthesis for Model Checking Modulo Theories, Automated Reasoning with Analytic Tableaux and Related Methods, pp.173-188, 2009.
DOI : 10.1007/978-3-642-02716-1_14

S. Ghilardi and S. Ranise, Model checking modulo theory at work : the intergration of yices in MCMT, Proceedings of AFM 09, 2009.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.3475

S. Ghilardi, S. Ranise, and T. Valsecchi, Light-Weight SMT-based Model Checking, Electronic Notes in Theoretical Computer Science, vol.250, issue.2, pp.85-102, 2009.
DOI : 10.1016/j.entcs.2009.08.019
URL : http://doi.org/10.1016/j.entcs.2009.08.019

L. Gonnord and N. Halbwachs, Combining Widening and Acceleration in Linear Relation Analysis, Static Analysis, pp.144-160, 2006.
DOI : 10.1007/11823230_10
URL : https://hal.archives-ouvertes.fr/hal-00189614

S. Graf and H. Saidi, Construction of abstract state graphs with PVS, Lecture Notes in Computer Science, vol.1254, pp.72-83, 1997.
DOI : 10.1007/3-540-63166-6_10

O. Grinchtein, M. Leucker, and N. Piterman, Inferring Network Invariants Automatically, IJCAR, pp.483-497, 2006.
DOI : 10.1007/11814771_40

O. Grumberg, T. Heyman, N. Ifergan, and A. Schuster, Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation, CHARME, pp.129-145, 2005.
DOI : 10.1007/11560548_12

A. Gurrnkel and S. Chaki, Combining predicate and numeric abstraction for software model checking, International Journal on Software Tools for Technology Transfer, vol.2, issue.4, pp.409-427, 2010.
DOI : 10.1007/s10009-010-0162-x

G. Hagen and C. Tinelli, Scaling up the formal veriication of lustre programs with smt-based techniques, Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, FMCAD '08, pp.1-15, 2008.

G. E. Hagen, Verifying Safety Properties of Lustre Programs : An SMT-based Approach, p.3347220, 2008.

M. A. Heinrich, The Performance and Scalability of Distributed Shared-memory Cache Coherence Protocols, 1999.

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

T. A. Henzinger, R. Jhala, R. Majumdar, and G. , Lazy abstraction, ACM SIGPLAN Notices, vol.37, issue.1, pp.58-70, 2002.
DOI : 10.1145/565816.503279

G. Higman, Ordering by Divisibility in Abstract Algebras, Proceedings of the London Mathematical Society, vol.3, issue.1, pp.3-2326, 1952.
DOI : 10.1112/plms/s3-2.1.326

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

W. Hodges, A Shorter Model Theory, 1997.

G. J. Holzmann, The model checker SPIN, IEEE Transactions on Software Engineering, vol.23, issue.5, pp.279-295, 1997.
DOI : 10.1109/32.588521

R. Jhala, Program veriication by lazy abstraction, 2004.

R. Jhala and R. Majumdar, Software model checking, ACM Computing Surveys, vol.41, issue.4, pp.1-2154, 2009.
DOI : 10.1145/1592434.1592438

B. Jonsson and M. Nilsson, Transitive Closures of Regular Relations for Verifying Infinite-State Systems, Tools and Algorithms for the Construction and Analysis of Systems, pp.220-235, 2000.
DOI : 10.1007/3-540-46419-0_16

T. Kahsai, Y. Ge, and C. Tinelli, Instantiation-Based Invariant Discovery, Proceedings of the Third International Conference on NASA Formal Methods, pp.192-206, 2011.
DOI : 10.1007/3-540-45319-9_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.678.5360

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

Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar, Symbolic model checking with rich assertional languages, Theoretical Computer Science, vol.256, issue.1-2, pp.424-435, 1997.
DOI : 10.1016/S0304-3975(00)00103-1

J. C. King, Symbolic execution and program testing, Communications of the ACM, vol.19, issue.7, pp.385-394, 1976.
DOI : 10.1145/360248.360252

G. Klein, K. Elphinstone, G. Heiser, J. Andronick, D. Cock et al., sel4 : Formal veriication of an os kernel, Proceedings of the ACM SIGOPS 22Nd Symposium on Operating Systems Principles, SOSP '09, pp.207-220, 2009.

K. Korovin, iprover?an instantiation-based theorem prover for rst-order logic (system description), Automated Reasoning, pp.292-298, 2008.

S. Krsti?, Parametrized system veriication with guard strengthening and parameter abstraction, AVIS, 2005.

R. P. Kurshan and K. Mcmillan, A structural induction theorem for processes, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, PODC '89, pp.239-247, 1989.

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

S. K. Lahiri and R. E. Bryant, Constructing Quantified Invariants via Predicate Abstraction, Veriication, Model Checking, and Abstract Interpretation, pp.267-281, 2004.
DOI : 10.1007/978-3-540-24622-0_22

S. K. Lahiri and R. E. Bryant, Indexed Predicate Discovery for Unbounded System Verification, Lecture Notes in Computer Science, vol.3114, pp.135-147, 2004.
DOI : 10.1007/978-3-540-27813-9_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.3383

S. K. Lahiri and R. E. Bryant, Predicate abstraction with indexed predicates, ACM Transactions on Computational Logic, vol.9, issue.1, 2007.
DOI : 10.1145/1297658.1297662
URL : http://arxiv.org/abs/cs/0407006

L. Lamport, A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, vol.17, issue.8, pp.453-455, 1974.
DOI : 10.1145/361082.361093

L. Lamport, How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs, IEEE Transactions on Computers, vol.28, issue.9, pp.690-691, 1979.
DOI : 10.1109/TC.1979.1675439

X. Leroy, A Formally Verified Compiler Back-end, Journal of Automated Reasoning, vol.27, issue.1, pp.363-446, 2009.
DOI : 10.1007/s10817-009-9155-4
URL : https://hal.archives-ouvertes.fr/inria-00360768

Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. Chang et al., STeP: The Stanford Temporal Prover, 1994.
DOI : 10.1007/3-540-59293-8_237

A. J. Martin, A new generalization of Dekker's algorithm for mutual exclusion, Information Processing Letters, vol.23, issue.5, pp.295-297, 1986.
DOI : 10.1016/0020-0190(86)90089-X

K. L. Mcmillan, Symbolic Model Checking : An Approach to the State Explosion Problem, UMI Order, pp.92-24209, 1992.

K. L. Mcmillan, Veriication of an implementation of tomasulo's algorithm by compositional model checking, Proceedings of the 10th International Conference on Computer Aided Veriication, CAV '98, pp.110-121, 1998.

K. L. Mcmillan, Parameterized veriication of the FLASH cache coherence protocol by compositional model checking, CHARME, pp.179-195, 2001.

K. L. Mcmillan, Lazy Abstraction with Interpolants, Proceedings of the 18th International Conference on Computer Aided Veriication, CAV'06, pp.123-136, 2006.
DOI : 10.1007/11817963_14

K. L. Mcmillan, Quantiied invariant generation using an interpolating saturation prover, TACAS, pp.413-427, 2008.

I. Melatti, CMurphi (Caching Murphi) http

I. Melatti, R. Palmer, G. Sawaya, Y. Yang, R. M. Kirby et al., Parallel and distributed model checking in Eddy, International Journal on Software Tools for Technology Transfer, vol.3, issue.1, pp.13-25, 2009.
DOI : 10.1007/s10009-008-0094-x

M. L. Minsky, Computation : Finite and Innnite Machines, 1967.

D. P. Monniaux, Automatic modular abstractions for linear constraints, Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '09, pp.140-151, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00336144

L. Moura and N. Bjørner, EEcient e-matching for SMT solvers, Proceedings of the 21st International Conference on Automated Deduction : Automated Deduction, CADE-21, pp.183-198, 2007.

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

G. Nelson and D. C. Oppen, Fast Decision Procedures Based on Congruence Closure, Journal of the ACM, vol.27, issue.2, pp.356-364, 1980.
DOI : 10.1145/322186.322198

M. Nilsson, Regular model checking, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00161119

D. Oe, A. Stump, C. Oliver, and K. Clancy, versat: A Verified Modern SAT Solver, Veriication, Model Checking, and Abstract Interpretation, pp.363-378, 2012.
DOI : 10.1016/j.scico.2007.07.008
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.459.7149

J. W. O-'leary, M. Talupur, and M. R. Tuttle, Protocol veriication using ows : An industrial experience, FMCAD, pp.172-179, 2009.

S. Owicki and D. Gries, Verifying properties of parallel programs: an axiomatic approach, Communications of the ACM, vol.19, issue.5, pp.279-285, 1976.
DOI : 10.1145/360051.360224

S. Owicki and L. Lamport, Proving Liveness Properties of Concurrent Programs, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.455-495, 1982.
DOI : 10.1145/357172.357178

S. Owre, J. M. Rushby, and N. Shankar, Pvs : A prototype veriication system, Automated Deduction?CADE-11, pp.748-752, 1992.

S. Park and D. L. Dill, Protocol veriication by aggregation of distributed transactions, CAV, pp.300-310, 1996.

S. Park and D. L. Dill, Veriication of ash cache coherence protocol by aggregation of distributed transactions, Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, pp.288-296, 1996.

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, The temporal semantics of concurrent programs, Proceedings of the International Symposium on Semantics of Concurrent Computation, pp.1-20, 1979.

A. Pnueli, S. Ruah, and L. D. Zuck, Automatic deductive veriication with invisible invariants, Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2001, pp.82-97, 2001.
DOI : 10.1007/3-540-45319-9_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.524

A. Pnueli, J. Xu, and L. D. Zuck, Liveness with (0,1, ???)- Counter Abstraction, Lecture Notes in Computer Science, vol.2404, pp.107-122, 2002.
DOI : 10.1007/3-540-45657-0_9

J. Queille and J. Sifakis, Speciication and veriication of concurrent systems in CESAR, Proceedings of the 5th Colloquium on International Symposium on Programming, pp.337-351, 1982.

A. Reynolds, C. Tinelli, A. Goel, and S. Krsti?, Finite Model Finding in SMT, Lecture Notes in Computer Science, vol.8044, pp.640-655, 2013.
DOI : 10.1007/978-3-642-39799-8_42

A. Reynolds, C. Tinelli, A. Goel, S. Krsti?, M. Deters et al., Quantifier Instantiation Techniques for Finite Model Finding in SMT, Lecture Notes in Computer Science, vol.7898, pp.377-391, 2013.
DOI : 10.1007/978-3-642-38574-2_26

A. Riazanov, A. Voronkov, and . Vampire, Vampire, Lecture Notes in Computer Science, vol.1632, pp.292-296, 1999.
DOI : 10.1007/3-540-48660-7_26

G. Ricart and A. K. Agrawala, An optimal algorithm for mutual exclusion in computer networks, Communications of the ACM, vol.24, issue.1, pp.9-17, 1981.
DOI : 10.1145/358527.358537

H. Rueß and N. Shankar, Deconstructing Shostak, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, p.19, 2001.
DOI : 10.1109/LICS.2001.932479

H. Saïdi, Model Checking Guided Abstraction and Analysis, Proceedings of the 7th International Symposium on Static Analysis, SAS '00, pp.377-396, 2000.
DOI : 10.1007/978-3-540-45099-3_20

I. Savnik, EEcient subset and superset queries, DB&Local Proceedings, volume 924 of CEUR Workshop Proceedings, pp.45-57, 2012.

M. Schmidt-schauß, Computational Aspects of an Order-sorted Logic with Term Declarations, 1989.
DOI : 10.1007/BFb0024065

S. Schulz, System Description: E??1.8, Logic for Programming, Artiicial Intelligence, and Reasoning, pp.735-743, 2013.
DOI : 10.1007/978-3-642-45221-5_49

M. Sheeran, S. Singh, and G. Stålmarck, Checking Safety Properties Using Induction and a SAT-Solver, Formal Methods in Computer-Aided Design, pp.127-144, 1954.
DOI : 10.1007/3-540-40922-X_8

J. R. Shoenneld, Mathematical logic, 1967.

R. E. Shostak, Deciding Combinations of Theories, Journal of the ACM, vol.31, issue.1, pp.1-12, 1984.
DOI : 10.1145/2422.322411

J. P. Silva and K. A. Sakallah, GRASP ? a new search algorithm for satissability, Proceedings of the 1996 IEEE/ACM International Conference on Computer-aided Design, ICCAD '96, pp.220-227, 1996.

A. Sistla and M. Zhou, Combining Static Analysis and Model Checking for Systems Employing Commutative Functions, Formal Techniques for Networked and Distributed Systems -FORTE 2005, pp.68-82, 2005.
DOI : 10.1007/978-3-662-03811-6

C. Sprenger, A veriied model checker for the modal µ-calculus in coq, Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems, TACAS '98, pp.167-183, 1998.

B. K. Szymanski, A simple solution to Lamport's concurrent programming problem with linear wait, Proceedings of the 2nd international conference on Supercomputing , ICS '88, pp.621-626, 1988.
DOI : 10.1145/55364.55425

M. Talupur and M. R. Tuttle, Going with the ow : Parameterized veriication using message ows, In FMCAD, pp.1-8, 2008.

A. S. Tanenbaum and M. Van-steen, Distributed Systems : Principles and Paradigms, 2006.

A. Thakur and T. Reps, A Method for Symbolic Computation of Abstract Operations, Proceedings of the 24th International Conference on Computer Aided Veriication, CAV'12, pp.174-192, 2012.
DOI : 10.1007/978-3-642-31424-7_17

M. Y. Vardi and P. Wolper, An automata-theoretic approach to automatic program veriication, Proceedings of the First Symposium on Logic in Computer Science, pp.332-344, 1986.

P. Wolper and V. Lovinfosse, Verifying properties of large sets of processes with network invariants, Proceedings of the International Workshop on Automatic Veriication Methods for Finite State Systems, pp.68-80, 1990.
DOI : 10.1007/3-540-52148-8_6

P. Wolper, M. Y. Vardi, and A. P. Sistla, Reasoning about innnite computation paths, Proceedings of the 24th Annual Symposium on Foundations of Computer Science, SFCS '83, pp.185-194, 1983.

L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik, EEcient connict driven learning in a boolean satissability solver, Proceedings of the 2001 IEEE/ACM International Conference on Computer-aided Design, ICCAD '01, pp.279-285, 2001.