M. Aldinucci and M. Danelutto, Skeleton-based parallel programming: Functional and parallel semantics in a single shot, Computer Languages, Systems & Structures, vol.33, issue.3-4, pp.179-192, 2007.
DOI : 10.1016/j.cl.2006.07.004

M. Aldinucci, M. Danelutto, and P. Dazzi, MUSKEL: An Expandable Skeleton Environment, Scientific International Journal for Parallel and Distributed Computing, vol.8, pp.325-341, 2007.

M. Alt, H. Bischof, and S. Gorlatch, Algorithm Design and Performance Prediction in a Java-Based Grid System with Skeletons, EUROPAR, pp.899-906, 2003.
DOI : 10.1007/3-540-45706-2_127

A. W. Appel and S. Blazy, Separation Logic for Small-Step cminor, Theorem Proving in Higher Order Logics (TPHOLs), pp.5-21, 2007.
DOI : 10.1007/978-3-540-74591-4_3
URL : https://hal.archives-ouvertes.fr/inria-00165915

M. Armand, B. Grégoire, A. Spiwack, and L. Théry, Extending Coq with Imperative Features and Its Application to SAT Verification, Interactive Theorem Proving (ITP), pp.83-98, 2010.
DOI : 10.1007/978-3-642-14052-5_8
URL : https://hal.archives-ouvertes.fr/inria-00502496

A. Armando, R. Carbone, and L. Compagna, LTL model checking for security protocols, Journal of Applied Non-Classical Logics, vol.3452, issue.4, pp.403-429, 2009.
DOI : 10.1016/S0304-3975(01)00141-4

A. Armando and L. Compagna, SAT-based model-checking for security protocols analysis, International Journal of Information Security, vol.9, issue.1, pp.3-32, 2008.
DOI : 10.1007/s10207-007-0041-y

A. Armando, The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications, Computer Aided Verification (CAV), pp.281-285, 2005.
DOI : 10.1007/11513988_27
URL : https://hal.archives-ouvertes.fr/inria-00000408

M. Armbrust, A. Fox, and R. Griffith, Above the Clouds: A Berkeley View of Cloud Computing, 2009.

B. Bacci, M. Danelutto, S. Orlando, S. Pelagatti, and M. Vanneschi, P3L: A structured high-level parallel language, and its structured support, Concurrency: Practice and Experiences, pp.225-255, 1995.
DOI : 10.1002/cpe.4330070305

H. E. Bal, M. F. Kaashoek, and A. S. Tanenbaum, Orca: a language for parallel programming of distributed systems, IEEE Transactions on Software Engineering, vol.18, issue.3, pp.190-205, 1992.
DOI : 10.1109/32.126768

M. Bamha and M. Exbrayat, Pipelining a Skew-Insensitive Parallel Join Algorithm. Parallel Processing Letters, pp.317-328, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00081339

M. Bamha and G. Hains, Frequency-adaptive Join for Shared Nothing Machines, Parallel and Distributed Computing Practices, pp.333-345, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00081345

M. Bamha and G. Hains, An Efficient Equi-semi-join Algorithm for Distributed Architectures, International Conference on Computational Science (ICCS), p.18, 2005.
DOI : 10.1007/11428848_97
URL : https://hal.archives-ouvertes.fr/hal-00081352

J. Barnat, Distributed Memory ltl Model Checking, p.87, 2004.
DOI : 10.1007/3-540-45139-0_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.2064

M. Barnett, M. Fähndrich, K. R. Leino, P. Müller, W. Schulte et al., Specification and verification, Communications of the ACM, vol.54, issue.6, pp.81-91, 2011.
DOI : 10.1145/1953122.1953145

B. Barras and B. Werner, coq in coq, p.96, 1997.

G. Barthe, B. Grégoire, and S. Z. Béguelin, Computer-Aided Cryptographic Proofs, International Symposium on Static Analysis (SAS), pp.1-2, 2012.
DOI : 10.1007/978-3-642-32347-8_2
URL : https://hal.archives-ouvertes.fr/hal-00765869

D. A. Basin, S. Mödersheim, and L. Viganò, An On-the-Fly Model-Checker for Security Protocol Analysis, European Symposium on Research in Computer Security (ESORICS), pp.253-270, 2003.
DOI : 10.1007/978-3-540-39650-5_15

A. Basumallik, S. Min, and R. Eigenmann, Programming Distributed Memory Sytems Using OpenMP, 2007 IEEE International Parallel and Distributed Processing Symposium, pp.1-8, 2007.
DOI : 10.1109/IPDPS.2007.370397
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.8570

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development, 2004.
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/hal-00344237

G. Bhat, R. Cleaveland, and O. Grumberg, Efficient on-the-fly model checking for CTL, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, pp.388-398, 1995.
DOI : 10.1109/LICS.1995.523273

R. H. Bisseling, Parallel Scientific Computation. A structured approach using bsp and mpi, Pages, vol.16, issue.17, pp.18-25, 2004.

R. H. Bisseling and W. F. Mccoll, Scientific Computing on Bulk Synchronous Parallel Architectures, Technology and Foundations: Information Processing, pp.509-514, 1994.

B. Blanchet, An efficient cryptographic protocol verifier based on prolog rules, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., p.96, 2001.
DOI : 10.1109/CSFW.2001.930138

S. Blazy and X. Leroy, Mechanized Semantics for the Clight Subset of the C Language, Journal of Automated Reasoning, vol.29, issue.6, pp.263-288, 2009.
DOI : 10.1007/s10817-009-9148-3
URL : https://hal.archives-ouvertes.fr/inria-00352524

S. Blom, J. F. Groote, S. Mauw, and A. Serebrenik, Analysing the BKE-security Protocol with ??CRL, Electronic Notes in Theoretical Computer Science, vol.139, issue.1, pp.49-90, 2005.
DOI : 10.1016/j.entcs.2005.09.005

R. Blumofe, C. Joerg, B. Kuszmaul, C. Leiserson, K. Randall et al., Cilk: An Efficient Multithreaded Runtime System, Principles and Practice of Parallel Programming (POPL), p.46, 1995.
DOI : 10.1006/jpdc.1996.0107
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.3175

F. Bobot and J. Filliâtre, Separation Predicates: A Taste of Separation Logic in First-Order Logic, Formal Ingineering Methods (ICFEM), p.75, 2012.
DOI : 10.1007/978-3-642-34281-3_14
URL : https://hal.archives-ouvertes.fr/hal-00825088

F. Bobot, J. Filliâtre, C. Marché, and A. Paskevich, Why3: Shepherd Your Herd of Provers, International Workshop on Intermediate Verification Languages (Boogie), p.21, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00790310

S. Böhme and T. Weber, Fast LCF-Style Proof Reconstruction for Z3, Interactive Theorem Proving (ITP), pp.179-194, 2010.
DOI : 10.1007/978-3-642-14052-5_14

O. Bonorden, Versatility of Bulk-Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip, p.18, 2008.

O. Bonorden, J. Gehweiler, and F. M. , A Web Computing Environment for Parallel Algorithms in Java, Scalable Computing: Practice and Experience, pp.1-14, 2006.
DOI : 10.1007/11752578_96

O. Bonorden, B. Judoiink, I. Von-otte, and O. Rieping, The Paderborn University BSP (PUB) library, Parallel Computing, vol.29, issue.2, pp.187-207, 2003.
DOI : 10.1016/S0167-8191(02)00218-1

O. Bonorden, J. Zur-gathen, J. Gerhard, O. Muller, and M. Nocker, Factoring a binary polynomial of degree over one million, ACM SIGSAM Bulletin, vol.35, issue.1, pp.16-18, 2001.
DOI : 10.1145/504331.504333

L. Bougé, D. Cachera, Y. L. Guyadec, G. Utard, and B. Virot, Formal validation of data-parallel programs: a two-component assertional proof system for a simple language, Theoretical Computer Science, vol.189, issue.1-2, pp.71-107, 1997.
DOI : 10.1016/S0304-3975(97)00041-8

W. Bousdira, F. Loulergue, and J. Tesson, A Verified Library of Algorithmic Skeletons on Evenly Distributed Arrays, Algorithms and Architectures for Parallel Processing (ICA3PP), pp.218-232, 2012.
DOI : 10.1007/978-3-642-33078-0_16
URL : https://hal.archives-ouvertes.fr/hal-00708822

C. Boyapati, R. Lee, and M. C. Rinard, Ownership Types for Safe Programming: Preventing Data-races and Deadlocks, OOPSLA, pp.211-230, 2002.

A. Braud and C. Vrain, A Parallel Genetic Algorithm based on the bsp Model, Evolutionary Computation and Parallel Processing GECCO & AAAI Workshop, p.18, 1999.

A. D. Brucker and S. Mödersheim, Integrating Automated and Interactive Protocol Verification, Formal Aspects in Security and Trust (FAST), pp.248-262, 2009.
DOI : 10.1007/978-3-642-12459-4_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.5457

J. Burnim and K. Sen, Asserting and checking determinism for multithreaded programs, Communications of the ACM, vol.53, issue.6, pp.97-105, 2010.
DOI : 10.1145/1743546.1743572
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.7876

R. Calinescu, Bulk Synchronous Parallel Algorithms for Optimistic Discrete Event Simulation, p.18, 1996.

F. Cappello, P. Fraigniaud, B. Mans, and A. L. Rosenberg, AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE, International Journal of Foundations of Computer Science, vol.16, issue.02, pp.195-215, 2005.
DOI : 10.1142/S0129054105002942

F. Cappello, A. Guermouche, and M. Snir, On Communication Determinism in Parallel HPC Applications, 2010 Proceedings of 19th International Conference on Computer Communications and Networks, pp.1-8, 2010.
DOI : 10.1109/ICCCN.2010.5560143

D. Caromel, L. Henrio, and M. Leyton, Type Safe Algorithmic Skeletons, 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008), pp.45-53, 2008.
DOI : 10.1109/PDP.2008.29

M. M. Chakravarty, R. Leshchinskiy, S. L. Jones, G. Keller, and S. Marlow, Data parallel Haskell, Proceedings of the 2007 workshop on Declarative aspects of multicore architectures , DAMP '07, pp.10-18, 2007.
DOI : 10.1145/1248648.1248652

A. Chan, F. Dehne, and R. Taylor, CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines, International Journal of High Performance Computing Applications, vol.19, issue.1, pp.19-23, 2005.
DOI : 10.1177/1094342005051196

S. Chaou, G. Utard, and F. Pommereau, Evaluating a peer-to-peer storage system in presence of malicious peers, 2011 International Conference on High Performance Computing & Simulation, pp.419-426, 2011.
DOI : 10.1109/HPCSim.2011.5999855
URL : https://hal.archives-ouvertes.fr/hal-00669179

B. Chapman, Using OpenMP: Portable Shared Memory Parallel Programming, p.15, 2008.

Y. Chen and J. Sanders, Logic of global synchrony, ACM Transactions on Programming Languages and Systems, vol.26, issue.2, pp.221-262, 2004.
DOI : 10.1145/973097.973098

Y. Chen and W. Sanders, Top-Down Design of Bulk-Synchronous Parallel Programs. Parallel Processing Letters, pp.389-400, 2003.

B. Cheng, Y. Jiang, and W. Tong, Hierarchical Resource Load Balancing Based on Multi-Agent in ServiceBSP Model, International Journal of Communications, Network and System Sciences, vol.03, issue.01, pp.59-65, 2010.
DOI : 10.4236/ijcns.2010.31008

A. Chlipala, Modular development of certified program verifiers with a proof assistant,, Journal of Functional Programming, vol.1, issue.5-6, pp.599-647, 2008.
DOI : 10.1023/B:JARS.0000021012.97318.e9

S. Christensen, L. M. Kristensen, and T. Mailund, A Sweep-Line Method for State Space Exploration, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 2031 of LNCS, pp.450-464, 2001.
DOI : 10.1007/3-540-45319-9_31

C. Chui, The LogP and MLogP models for parallel image processing with multi-core microprocessor, Proceedings of the 2010 Symposium on Information and Communication Technology, SoICT '10, pp.23-27, 2010.
DOI : 10.1145/1852611.1852616

P. Ciechanowicz and H. Kuchen, Enhancing Muesli's Data Parallel Skeletons for Multi-core Computer Architectures, 2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC), pp.108-113, 2010.
DOI : 10.1109/HPCC.2010.23

E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking, p.11, 2000.

F. Clément, V. Martin, A. Vodicka, R. D. Cosmo, and P. Weis, Domain decomposition and skeleton programming with OCamlP3l, Parallel Computing, vol.32, issue.7-8, pp.539-550, 2006.
DOI : 10.1016/j.parco.2006.04.003

E. Cohen, M. Dahlweid, M. A. Hillebrand, D. Leinenbach, M. Moskal et al., VCC: A Practical System for Verifying Concurrent C, Theorem Proving in Higher Order Logics (TPHOLs), pp.23-42, 2009.
DOI : 10.1007/978-3-540-74591-4_15

M. Cole, Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming, Parallel Computing, vol.30, issue.3, pp.389-406, 2004.
DOI : 10.1016/j.parco.2003.12.002

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, Symposium on Theoretical Aspects of Computer Science (STACS), pp.29-44, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573590

V. Cortier, S. Kremer, and B. Warinschi, A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems, Journal of Automated Reasoning, vol.13, issue.1, pp.225-259, 2011.
DOI : 10.1007/s10817-010-9187-9
URL : https://hal.archives-ouvertes.fr/inria-00525776

V. G. Costa and M. Marín, A Parallel Search Engine with BSP, Third Latin American Web Congress (LA-WEB'2005), pp.259-268, 2005.
DOI : 10.1109/LAWEB.2005.7

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

C. J. Cremers, Scyther -Semantics and Verification of Security Protocols, p.96, 2006.

J. F. Cremers, P. Lafourcade, and P. Nadeau, Comparing State Spaces in Automatic Security Protocol Analysis, Formal to Practical Security, pp.70-94, 2009.
DOI : 10.1007/11805618_21

D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser et al., LogP: towards a realistic model of parallel computation, ACM SIGPLAN Notices, vol.28, issue.7, pp.1-12, 1993.
DOI : 10.1145/173284.155333

R. Da-rosa-righi, L. L. Pilla, A. Carissimi, P. O. Navaux, and H. Heiss, MigBSP: A Novel Migration Model for Bulk-Synchronous Parallel Processes Rescheduling, High Performance Computing and Communications (HPCC), pp.585-590, 2009.

N. Dalal, J. Shah, K. Hisaria, and D. Jinwala, A Comparative Analysis of Tools for Verification of Security Protocols, International Journal of Communications, Network and System Sciences, vol.03, issue.10, pp.779-787, 2010.
DOI : 10.4236/ijcns.2010.310104

A. Danalis, L. Pollock, and M. Swany, Automatic MPI application transformation with ASPhALT, 2007 IEEE International Parallel and Distributed Processing Symposium, p.130, 2007.
DOI : 10.1109/IPDPS.2007.370486

M. Daum, Reasoning on Data-Parallel Programs in Isabelle/Hol, p.76, 2007.

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.53, issue.1, pp.72-77, 2010.
DOI : 10.1145/1629175.1629198

F. Dehne, Special Issue on Coarse-grained Parallel Algorithms, Algorithmica, vol.14, pp.173-421, 1999.

F. Dehne, A. Fabri, and A. Rau-chaplin, SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.379-400, 1996.
DOI : 10.1142/S0218195996000241

J. Hartog, Towards mechanized correctness proofs for cryptographic algorithms, Science of Computer Programming, vol.74, issue.1-2, pp.52-63, 2008.
DOI : 10.1016/j.scico.2008.09.006

N. Deo and P. Micikevicius, Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem, Distributed Computing, Mobile and Wireless Computing (IWDC), volume 2571 of LNCS, pp.55-66, 2002.
DOI : 10.1007/3-540-36385-8_6

J. Desouza, B. Kuhn, B. R. De-supinski, V. Samofalov, S. Zheltov et al., Automated, scalable debugging of MPI programs with Intel?? Message Checker, Proceedings of the second international workshop on Software engineering for high performance computing system applications , SE-HPCS '05, pp.78-82, 2005.
DOI : 10.1145/1145319.1145342

G. F. Diamos, A. R. Kerr, S. Yalamanchili, and N. Clark, Ocelot, Proceedings of the 19th international conference on Parallel architectures and compilation techniques, PACT '10, pp.353-364, 2010.
DOI : 10.1145/1854273.1854318

E. W. Dijkstra, Letter to the Editor, Journal of the American Oil Chemists' Society, vol.79, issue.4, pp.147-148, 1968.
DOI : 10.1007/s11746-010-1551-8

E. W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Communications of the ACM, vol.18, issue.8, pp.453-457, 1975.
DOI : 10.1145/360933.360975

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.
DOI : 10.1109/TIT.1983.1056650

D. C. Dracopoulos and S. Kent, Speeding up Genetic Programming: A Parallel bsp Implementation, Genetic Programming (GP), p.18, 1996.

N. Drosinos and N. Koziris, Performance comparison of pure MPI vs hybrid MPI-OpenMP parallelization models on SMP clusters, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., pp.1-15, 2004.
DOI : 10.1109/IPDPS.2004.1302919

R. Duncan, A survey of parallel computer architectures, Computer, vol.23, issue.2, p.14, 1990.
DOI : 10.1109/2.44900

N. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov, Undecidability of Bounded Security Protocols, Formal Methods and Security Protocols (FMSP), part of FLOC conference, p.85, 1999.

J. Eisenbiegler, W. Löwe, and W. Zimmermann, BSP, LogP, and oblivious programs, Euro-ParConference on Parallel Processing, pp.865-874, 1998.
DOI : 10.1007/BFb0057942

T. A. El-ghazawi and L. Smith, UPC: Unified Parallel C, High Performance Networking and Computing (SC), pp.27-46, 2006.
DOI : 10.1002/0471478369

J. Esparza, P. Lammich, R. Neumann, T. Nipkow, A. Schimpf et al., A Fully Verified Executable LTL Model Checker, Computer Aided Verification (CAV), pp.95-96, 2013.
DOI : 10.1007/978-3-642-39799-8_31
URL : https://hal.archives-ouvertes.fr/hal-01226469

J. Falcou, J. Serot, T. Chateau, and J. T. Lapreste, Quaff: efficient C++ design for parallel skeletons, Parallel Computing, vol.32, issue.7-8, pp.604-615, 2006.
DOI : 10.1016/j.parco.2006.06.001
URL : https://hal.archives-ouvertes.fr/hal-00167412

P. Ferragina and F. Luccio, String Search in Coarse-Grained Parallel Computers, Algorithmica, vol.24, issue.3-4, pp.177-194, 1999.
DOI : 10.1007/PL00008259

A. Ferreira, I. Guérin-lassous, K. Marcus, and A. Rau-chauplin, Parallel Computation on Interval Graphs: Algorithms and Experiments. Concurrency and Computation: Practice and Experience, pp.885-910, 2002.
DOI : 10.1002/cpe.700
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8796

F. Filliâtre, Verification of non-functional programs using interpretations in type theory, Journal of functional Programming, vol.13, issue.4, 2003.
DOI : 10.1017/S095679680200446X

J. Filliâtre, Verifying Two Lines of C with Why3: An Exercise in Program Verification, Verified Software: Theories, Tools and Experiments (VSTTE), pp.2012-2033
DOI : 10.1145/360051.360224

J. Filliâtre and C. Marché, Multi-prover Verification of C Programs, Formal Engineering Methods (ICFEM), pp.15-29, 2004.
DOI : 10.1007/978-3-540-30482-1_10

J. Filliâtre and C. Marché, The Why/Krakatoa/Caduceus Platform for Deductive Program Verification, Computer Aided Verification (CAV), 2007.
DOI : 10.1007/978-3-540-73368-3_21

M. Fluet, M. Rainey, J. Reppy, and A. Shaw, Implicitly-threaded parallelism in Manticore, ACM SIGPLAN Notices, vol.43, issue.9, pp.119-130, 2008.
DOI : 10.1145/1411203.1411224

M. Flynn, Some Computer Organizations and Their Effectiveness, IEEE Transactions on Computers, vol.21, issue.9, pp.948-960, 1972.
DOI : 10.1109/TC.1972.5009071

W. Fokkink, M. T. Dashti, and A. Wijs, Partial Order Reduction for Branching Security Protocols, 2010 10th International Conference on Application of Concurrency to System Design, pp.191-200, 2010.
DOI : 10.1109/ACSD.2010.19

J. Ford and N. Shankar, Formal Verification of a Combination Decision Procedure, LNCS, vol.2392, pp.347-362, 2002.
DOI : 10.1007/3-540-45620-1_29

J. Fortin and F. Gava, BSP-WHY, Proceedings of the fourth international workshop on High-level parallel programming and applications, HLPP '10, pp.35-44, 2010.
DOI : 10.1145/1863482.1863491
URL : https://hal.archives-ouvertes.fr/tel-00974977

J. Fortin and F. Gava, From BSP routines to high-performance ones: Formal verification of a transformation case, Procedia Computer Science, vol.1, issue.1, pp.155-164, 2010.
DOI : 10.1016/j.procs.2010.04.018

M. I. Frank, A. Agarwal, and M. K. Vernon, LoPC: Modeling Contention in Parallel Algorithms, Principles and Practice of Parallel Programming (PPoPP), pp.276-287, 1997.

L. Fronc and F. Pommereau, Towards a Certified Petri Net Model-Checker, Programming Languages and Systems (APLAS), pp.322-336, 2011.
DOI : 10.1007/3-540-44464-5_13
URL : https://hal.archives-ouvertes.fr/hal-00666660

C. A. Furia and B. Meyer, Inferring Loop Invariants Using Postconditions, Fields of Logic and Computation, pp.277-300, 2010.
DOI : 10.1145/964001.964028
URL : http://arxiv.org/abs/0909.0884

H. Gao, Analysis of Security Protocols by Annotations, p.97, 2008.

H. Garavel, R. Mateescu, and I. M. Smarandache, Parallel state space construction for model-checking, Proceedings of SPIN, pp.217-234, 2001.
DOI : 10.1007/3-540-45139-0_14
URL : https://hal.archives-ouvertes.fr/inria-00072247

F. Gava, Formal Proofs of Functional bsp Programs. Parallel Processing Letters, Pages, vol.13, issue.20, pp.365-376, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00005601

F. Gava, Une biblioth??que certifi??e de programmes fonctionnels BSP, Techniques et sciences informatiques, vol.25, issue.10, pp.1261-1280, 2006.
DOI : 10.3166/tsi.25.1261-1280

F. Gava and J. Fortin, Formal Semantics of a Subset of the Paderborn's BSPlib, 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies, pp.77-99, 2008.
DOI : 10.1109/PDCAT.2008.43

F. Gava, J. Fortin, and M. Guedj, Deductive Verification of State-Space Algorithms, integrated Formal Methods (iFM), 2013.
DOI : 10.1007/978-3-642-38613-8_9

F. Gava, M. Guedj, and F. Pommereau, A BSP Algorithm for the State Space Construction of Security Protocols, 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology, pp.37-44, 2010.
DOI : 10.1109/PDMC-HiBi.2010.14
URL : https://hal.archives-ouvertes.fr/hal-00669177

F. Gava, M. Guedj, and F. Pommereau, Performance Evaluations of a BSP Algorithm for State Space Construction of Security Protocols, 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing, pp.170-174, 2012.
DOI : 10.1109/PDP.2012.65
URL : https://hal.archives-ouvertes.fr/hal-00745201

F. Gava, A. Hidalgo, and J. Fortin, Mechanised Verification of Distributed State-Space Algorithms for Security Protocols, 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies, p.79
DOI : 10.1109/PDCAT.2012.93

F. Gava and J. Fortin, Two Formal Semantics of a Subset of the Paderborn University BSPlib, 2009 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing, pp.99-105, 2009.
DOI : 10.1109/PDP.2009.49

A. V. Gerbessiotis, Topics in Parallel and Distributed Computation, p.18, 1993.

A. V. Gerbessiotis, C. J. Siniolakis, and A. Tiskin, Parallel priority Queue and list contraction: The BSP approach, Computing and Informatics, vol.21, pp.59-90, 2002.
DOI : 10.1007/BFb0002764

A. V. Gerbessiotis and L. G. Valiant, Direct Bulk-Synchronous Parallel Algorithms, Journal of Parallel and Distributed Computing, vol.22, issue.2, pp.251-267, 1994.
DOI : 10.1006/jpdc.1994.1085
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9332

R. Gerth and W. P. De-roever, A proof system for concurrent ADA programs, Science of Computer Programming, vol.4, issue.2, pp.159-204, 1984.
DOI : 10.1016/0167-6423(84)90018-2

L. Gesbert, F. Gava, F. Loulergue, and F. Dabrowski, Bulk synchronous parallel ML with exceptions, Future Generation Computer Systems, vol.26, issue.3, pp.486-490, 2010.
DOI : 10.1016/j.future.2009.05.021
URL : https://hal.archives-ouvertes.fr/inria-00452559

L. Gesbert, Z. Hu, F. Loulergue, K. Matsuzaki, and J. Tesson, Systematic Development of Correct Bulk Synchronous Parallel Programs, 2010 International Conference on Parallel and Distributed Computing, Applications and Technologies, pp.334-340, 2010.
DOI : 10.1109/PDCAT.2010.86
URL : https://hal.archives-ouvertes.fr/hal-00512867

A. Ghuloum, E. Sprangle, J. Fang, G. Wu, and X. Zhou, Ct, Proceedings of the 4th ACM SIGPLAN workshop on Commercial users of functional programming , CUFP '07, pp.25-33, 2007.
DOI : 10.1145/1362702.1362707

A. Goldman, D. Cordeiro, and A. Kraemer, The suitability of bsp/CGM model for Clouds, High Performance Computing, Grids and Clouds (HPC), 2012. Pages 41 and 42

H. González-vélez and M. Leyton, A Survey of Algorithmic Skeleton Frameworks: High-level Structured Parallel Programming Enablers. Software, Practrice & Experience, pp.1135-1160, 2010.

G. Gopalakrishnan and R. M. Kirby, Runtime verification methods for MPI, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-5, 2008.
DOI : 10.1109/IPDPS.2008.4536437

G. Gopalakrishnan, R. M. Kirby, S. F. Siegel, R. Thakur, W. Gropp et al., Formal analysis of MPI-based parallel programs, Communications of the ACM, vol.54, issue.12, pp.82-91, 2011.
DOI : 10.1145/2043174.2043194

S. Gorlatch, Send-receive considered harmful, ACM Transactions on Programming Languages and Systems, vol.26, issue.1, pp.47-56, 2004.
DOI : 10.1145/963778.963780

S. Gorlatch and M. Cole, Parallel Skeletons, Encyclopedia of Parallel Computing, pp.1417-1422, 2011.

A. Gotsman, J. Berdine, B. Cook, and M. Sagiv, Thread-modular Shape Analysis, Programming Language Design and Implementation (PLDI), p.75, 2007.

J. Goubault-larrecq, Finite models for formal security proofs, Journal of Computer Security, vol.18, issue.6, pp.1247-1299, 2010.
DOI : 10.3233/JCS-2009-0395

L. Graebin, R. Da, and R. Righi, jMigBSP: Object Migration and Asynchronous One-Sided Communication for BSP Applications, 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp.35-38, 2011.
DOI : 10.1109/PDCAT.2011.48

L. Granvilliers, G. Hains, Q. Miller, and N. Romero, A System for the High-level Parallelization and Cooperation of Constraint Solvers, Parallel and Distributed Computing and Systems (PDCS), pp.596-601, 1998.

C. Grelck and S. Scholz, Classes and Objects as Basis for I/O in SAC, Implementation of Functional Languages (IFL), pp.30-44, 1995.

I. Grudenic and N. Bogunovic, Modeling and Verification of mpi Based Distributed Software Recent Advances in pvm and mpi, User's Group Meeting, LNCS, vol.4192, pp.123-132, 2006.

Y. Gu, B. Le, and C. Wentong, JBSP: A BSP Programming Library in Java, Journal of Parallel and Distributed Computing, vol.61, issue.8, pp.611126-1142, 2001.
DOI : 10.1006/jpdc.2001.1735

I. Guérin-lassous and J. Gustedt, Portable List Ranking: An Experimental Study, ACM Journal of Experiments Algorithms, vol.7, issue.7, pp.1-18, 2002.
DOI : 10.1007/3-540-44691-5_10

K. Hamidouche, A. Borghi, P. Esterie, J. Falcou, and S. Peyronnet, Three High Performance Architectures in the Parallel APMC Boat, 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology, pp.20-27, 2010.
DOI : 10.1109/PDMC-HiBi.2010.12

K. Hamidouche, J. Falcou, and D. Etiemble, A Framework for an Automatic Hybrid mpi +openmp Code Generation, Simulation Multi-conference (SpringSim) on High Performance Computing Symposia (HPC), pp.48-55, 2011.

K. Hammond, Parallel Functional Programming: An Introduction, International Symposium on Parallel Symbolic Computation. World Scientific, p.46, 1994.

K. Hammond, J. Berthold, and R. Loogen, AUTOMATIC SKELETONS IN TEMPLATE HASKELL, Parallel Processing Letters, vol.13, issue.03, pp.413-424, 2003.
DOI : 10.1142/S0129626403001380

Y. Hayashi and M. Cole, AUTOMATED COST ANALYSIS OF A PARALLEL MAXIMUM SEGMENT SUM PROGRAM DERIVATION, Parallel Processing Letters, vol.12, issue.01, pp.95-112, 2002.
DOI : 10.1142/S0129626402000859

B. Hendrickson, Computational science: Emerging opportunities and challenges, Journal of Physics: Conference Series, vol.180, issue.1, 2009.
DOI : 10.1088/1742-6596/180/1/012013

D. S. Henty, Performance of Hybrid Message-Passing and Shared-Memory Parallelism for Discrete Element Modeling, ACM/IEEE SC 2000 Conference (SC'00), p.16, 2000.
DOI : 10.1109/SC.2000.10005

P. Herms, Certification of a Chain for Deductive Program Verification, pp.126-127, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00535640

P. Herms, Certification of a Tool Chain for Deductive Program Verification, (LRI), 2013. Pages 127 and 130
URL : https://hal.archives-ouvertes.fr/tel-00789543

J. M. Hill, B. Mccoll, D. C. Stefanescu, M. W. Goudreau, K. Lang et al., BSPlib: The BSP programming library, Parallel Computing, vol.24, issue.14, pp.1947-1980, 1998.
DOI : 10.1016/S0167-8191(98)00093-3

J. M. Hill and D. B. Skillicorn, Practical barrier synchronisation, Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing, PDP '98 -, p.16, 1998.
DOI : 10.1109/EMPDP.1998.647231
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8214

K. Hinsen, H. P. Langtangen, O. Skavhaug, and Å. Ødegård, Using B SP and Python to simplify parallel programming, Future Generation Computer Systems, vol.22, issue.1-2, pp.123-157, 2006.
DOI : 10.1016/j.future.2003.09.003

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

C. A. Hoare, J. Misra, G. T. Leavens, and N. Shankar, The verified software initiative, ACM Computing Surveys, vol.41, issue.4, p.9, 2009.
DOI : 10.1145/1592434.1592439

A. Hobor, A. W. Appel, and F. Z. Nardelli, Oracle Semantics for Concurrent Separation Logic, European Symposium on Programming (ESOP), number 4960 in LNCS, pp.353-367, 2008.
DOI : 10.1007/978-3-540-78739-6_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4226

A. Hobor and C. Gherghina, Barriers in Concurrent Separation Logic, Now With Tool Support! Logical Methods in Computer Science, vol.375, issue.1, pp.2012-124
DOI : 10.1007/978-3-642-12002-2_23

G. Horvitz and R. H. Bisseling, Designing a bsp version of ScaLAPACK, Conference on Parallel Processing for Scientific Computing. SIAM, p.18, 1999.

Q. Hou, K. Zhou, and B. Guo, BSGP: Bulk-Synchronous gpu Programming, ACM Trans. Graph. Pages, vol.27, issue.18, pp.25-34, 2008.

C. Huang and S. Rajasekaran, High-performance parallel bio-computing, Parallel Computing, vol.30, issue.9-10, pp.999-1000, 2004.
DOI : 10.1016/j.parco.2004.01.003

A. Iosup, O. Sonmez, S. Anoep, and D. Epema, The performance of bags-of-tasks in large-scale distributed systems, Proceedings of the 17th international symposium on High performance distributed computing, HPDC '08, pp.97-108, 2008.
DOI : 10.1145/1383422.1383435

B. Jacobs, J. Smans, P. Philippaerts, F. Vogels, W. Penninckx et al., VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java, NASA Formal Methods, pp.41-55, 2011.
DOI : 10.1007/11691372_19

B. Jacobs, J. Smans, F. Piessens, and W. Schulte, A Statically Verifiable Programming Model for Concurrent Objectoriented Programs, International Conference on Formal Engineering Methods (ICFEM), pp.420-439, 2006.

H. Jifeng, Q. Miller, and L. Chen, Algebraic laws for BSP programming, Euro-Par, number 1124 in LNCS, pp.359-368, 1996.
DOI : 10.1007/BFb0024724

C. B. Jones, P. W. O-'hearn, and J. Woodcock, Verified Software: A Grand Challenge, Computer, vol.39, issue.4, pp.93-95, 2006.
DOI : 10.1109/MC.2006.145

S. A. Joseph, Evaluating Threading Building Blocks Pipelines, p.15, 2007.

C. Kaner, J. Falk, and H. Q. Nguyen, Testing Computer Software, p.11, 1999.

J. Kanig and J. Filliâtre, Who, Proceedings of the 2009 ACM SIGPLAN workshop on ML, ML '09, p.75, 2009.
DOI : 10.1145/1596627.1596634
URL : https://hal.archives-ouvertes.fr/hal-00777585

C. W. Keßler, NestStep: Nested Parallelism and Virtual Shared Memory for the bsp Model, The Journal of Supercomputing, vol.17, issue.3, pp.245-262, 2000.
DOI : 10.1023/A:1026511306490

T. Kielmann and S. Gorlatch, Bandwidth-Latency Models (BSP, LogP), Encyclopedia of Parallel Computing, pp.107-112, 2011.
DOI : 10.1007/978-0-387-09766-4_189

W. J. Knottenbelt, M. A. Mestern, P. G. Harrison, and P. Kritzinger, Probability, Parallelism and the State Space Exploration Problem, Computer Performance Evaluation- Modeling, Techniques and Tools (TOOLS), number 1469 in LNCS, pp.165-179, 1998.
DOI : 10.1007/3-540-68061-6_14

L. Kovács and A. Voronkov, Finding Loop Invariants for Programs over Arrays Using a Theorem Prover, LNCS, vol.5503, pp.470-485, 2009.

B. Krammer, K. Bidmon, M. S. Müller, and M. M. Resch, MARMOT: An MPI analysis and checking tool, Parallel Computing, 2003.
DOI : 10.1016/S0927-5452(04)80063-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1372

P. Krusche and A. Tiskin, New algorithms for efficient parallel string comparison, Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures, SPAA '10, pp.209-216, 2010.
DOI : 10.1145/1810479.1810521

H. Kuchen and M. Cole, The Integration of Task and Data Parallel Skeletons. Parallel Processing Letters, pp.141-155, 2002.

H. Kuchen and J. Striegnitz, Features from Functional Programming for a C++ Skeleton Library. Concurrency - Practice and Experience, pp.739-756, 2005.

A. Kukanov, The Foundations for Scalable Multi-core Software in Intel Threading Building Blocks, Intel Technology Journal, vol.11, issue.4, pp.309-322, 2007.

L. Lamport and F. B. Schneider, The ``Hoare Logic'' of CSP, and All That, ACM Transactions on Programming Languages and Systems, vol.6, issue.2, pp.281-296, 1984.
DOI : 10.1145/2993.357247

I. G. Lassous, Algorithmes Paralleles de Traitement de Graphes: une Approche Basee sur l'Analyse Experimentale, p.18, 1999.

D. S. Lecomber, A Semantics for Parallel Programming with bsp, p.124

E. A. Lee, The Problem with Threads, Computer, vol.39, issue.5, pp.18-76, 2006.
DOI : 10.1109/MC.2006.180

K. R. Leino, Verifying Concurrent Programs with Chalice, Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.2-76, 2010.
DOI : 10.1007/978-3-642-11319-2_2

K. R. Leino and P. Muller, A Basis for Verifying Multi-threaded Programs, ESOP, p.76, 2009.
DOI : 10.1007/978-3-642-00590-9_27

F. Lerda and R. Sista, Distributed-Memory Model Checking with SPIN, Proceedings of SPIN, number 1680 in LNCS, pp.22-39, 1999.
DOI : 10.1007/3-540-48234-2_3

X. Leroy, Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, pp.107-115, 2009.
DOI : 10.1145/1538788.1538814
URL : https://hal.archives-ouvertes.fr/inria-00415861

X. Leroy and H. Grall, Coinductive big-step operational semantics, Information and Computation, vol.207, issue.2, pp.284-304, 2009.
DOI : 10.1016/j.ic.2007.12.004
URL : https://hal.archives-ouvertes.fr/inria-00309010

M. Leyton and J. M. Piquer, Skandium: Multi-core Programming with Algorithmic Skeletons, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing, pp.289-296, 2010.
DOI : 10.1109/PDP.2010.26

C. Li and G. Hains, SGL: towards a bridging model for heterogeneous hierarchical platforms, International Journal of High Performance Computing and Networking, vol.7, issue.2, pp.139-151, 2012.
DOI : 10.1504/IJHPCN.2012.046371

G. Li, On-the-fly Model Checking of Security Protocols, p.96, 2008.

G. Li, M. Delisi, G. Gopalakrishnan, and R. M. Kirby, Formal specification of the MPI-2.0 standard in TLA+, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.283-284, 2008.
DOI : 10.1145/1345206.1345257

X. Liu, W. Tong, and Y. Hou, BSPCloud: A Programming Model for Cloud Computing, 2012 IEEE 12th International Conference on Computer and Information Technology, pp.1109-1113, 2012.
DOI : 10.1109/CIT.2012.225

A. Lluch-lafuente, Simplified Distributed Model-checking by Localizing Cycles, p.97, 2002.

H. Loidl, F. Rubio, N. Scaife, K. Hammond, S. Horiguchi et al., Comparing Parallel Functional Languages: Programming and Performance. Higher Order and Symb, Comp, vol.16, issue.3, pp.203-251, 2003.

G. Lowe, Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR, Tools and Algorithms for Construction and Analysis of Systems (TACAS), pp.147-166, 1996.
DOI : 10.1007/3-540-61042-1_43

G. Lowe, Casper: A compiler for the analysis of security protocols, Journal of Computer Security, vol.6, issue.1-2, pp.53-84, 1998.
DOI : 10.3233/JCS-1998-61-204

G. R. Luecke, H. Chen, J. Coyle, J. Hoekstra, M. Kraeva et al., mpi-CHECK: a tool for checking Fortran 90 mpi programs. Concurrency and Computation: Practice and Experience, pp.93-100, 2003.

B. Maggs, L. Matheson, and R. Tarjan, Models of parallel computation: a survey and synthesis, Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, p.16, 1995.
DOI : 10.1109/HICSS.1995.375476

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn et al., Pregel: A System for Large-scale Graph Processing, Management of data, pp.135-146, 2010.

A. Malkis and A. Banerjee, Verification of Software Barriers, Principles and Practice of Parallel Programming (PPOPP), pp.313-314, 2012.

A. Malkis and L. Mauborgne, On the Strength of Owicki-Gries for Resources, Programming Languages and Systems (APLAS), pp.172-187, 2011.
DOI : 10.1145/360051.360224

W. R. Marrero, Brutus: a Model-checker for Security Protocols, p.96, 2001.

J. M. Martin and Y. Huddart, Parallel Algorithms for Deadlock and Livelock Analysis of Concurrent Systems, Communicating Process Architectures, pp.1-14, 2000.

D. R. Martinez, J. C. Cabaleiro, T. F. Pena, F. F. Rivera, and V. Blanco, Accurate analytical performance model of communications in MPI applications, 2009 IEEE International Symposium on Parallel & Distributed Processing, pp.1-8, 2009.
DOI : 10.1109/IPDPS.2009.5161175

B. D. Martino, A. Mazzeo, M. Mazzocca, and U. Villano, Parallel program analysis and restructuring by detection of point-to-point interaction patterns and their transformation into collective communication constructs, Science of Computer Programming, vol.40, issue.2-3, pp.235-263, 2001.
DOI : 10.1016/S0167-6423(01)00017-X

K. Matsuzaki, Efficient Implementation of Tree Accumulations on Distributed-Memroy Parallel Computers, Practical Aspects of High-Level Parallel Programming (PAPP), part of The International Conference on Computational Science (ICCS), p.18, 2007.

S. Meier, C. J. Cremers, and D. A. Basin, Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs, 2010 23rd IEEE Computer Security Foundations Symposium, pp.231-245, 2010.
DOI : 10.1109/CSF.2010.23

Q. Miller, bsp in a Lazy Functional Context, Trends in Functional Programming, p.25, 2002.

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

K. S. Namjoshi, Certifying Model Checkers, Computer Aided Verification (CAV), pp.2-13, 2001.
DOI : 10.1007/3-540-44585-4_2

A. Nanevski, G. Morrisett, A. Shinnar, P. Govereau, and L. Birkedal, Ynot: Reasoning with the Awkward Squad, International Conference on Functional Programming (ICFP), p.75, 2008.

G. C. Necula, Proof-carrying code, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.106-119, 1997.
DOI : 10.1145/263699.263712

J. Nickolls, I. Buck, M. Garland, and K. Skadron, Scalable parallel programming with CUDA, Queue, vol.6, issue.2, pp.40-53, 2008.
DOI : 10.1145/1365490.1365500

L. P. Nieto, Verification of Parallel Programs with the Owicki-Gries and Rely-Guarantee Methods in Isabelle, 2001.

L. P. Nieto and J. Esparza, Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL, Mathematical Foundations of Computer Science (MFCS), volume 1893 of LNCS, pp.619-628, 2000.
DOI : 10.1007/3-540-44612-5_57

P. W. O-'hearn, Resources, Concurrency and Local Reasoning, Theoretical Computer Science, vol.375, issue.1, pp.271-307, 2007.

P. Ohly, W. Krotz, and . Vogel, Automated mpi Correctness Checking: What if There Were a Magic Option? In High-Performance Clustered Computing, p.19, 2007.

S. Orzan, J. Van-de-pol, and M. Espada, A State Space Distributed Policy Based on Abstract Interpretation, ENTCS, pp.35-45, 2005.

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

C. Pajault, Model Checking Parallèle et Réparti de Réseaux de Petri Colorés de Haut-niveau, Conservatoire National des Arts et Métiers, p.97, 2008.

L. C. Paulson, The inductive approach to verifying cryptographic protocols, Journal of Computer Security, vol.6, issue.1-2, pp.85-128, 1998.
DOI : 10.3233/JCS-1998-61-205

D. Peled, A. Pnueli, and L. D. Zuck, From Falsification to Verification, Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.292-304, 2001.
DOI : 10.1007/3-540-45294-X_25

S. Pervez, G. Gopalakrishnan, R. M. Kirby, R. Thakur, and W. Gropp, Formal Verification of Programs That Use MPI One-Sided Communication, Recent Advances in pvm and mpi, pp.30-39, 2006.
DOI : 10.1007/11846802_13

D. Petcu, Parallel explicit state reachability analysis and state space construction, Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings., pp.207-214, 2003.
DOI : 10.1109/ISPDC.2003.1267665

P. Philippaerts, J. T. Mhlberg, W. Penninckx, J. Smans, B. Jacobs et al., Software verification with VeriFast: Industrial case studies, Science of Computer Programming, vol.82, 2013.
DOI : 10.1016/j.scico.2013.01.006

J. Pje?ivac-grbovi?, T. Angskun, G. Bosilca, G. E. Fagg, E. Gabriel et al., Performance analysis of MPI collective operations, Cluster Computing, vol.22, issue.6, pp.127-143, 2007.
DOI : 10.1007/s10586-007-0012-0

M. Redekopp, Y. Simmhan, and V. K. Prasanna, Optimizations and Analysis of BSP Graph Processing Models on Public Clouds, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, 2013.
DOI : 10.1109/IPDPS.2013.76

Y. Régis-gianas and F. Pottier, A Hoare Logic for Call-by-Value Functional Programs, Mathematics of Program Construction (MPC), pp.305-335, 2008.
DOI : 10.1007/978-3-540-70594-9_17

J. H. Reppy, Concurrent Programming in ML, p.47, 1999.
DOI : 10.1017/CBO9780511574962

X. Rival and J. Goubault-larrecq, Experiments with Finite Tree Automata in Coq, Theorem Proving in Higher Order Logics (TPHOL), pp.362-377, 2001.
DOI : 10.1007/3-540-44755-5_25

R. O. Rogers and D. B. Skillicorn, Using the BSP cost model to optimise parallel neural network training, Future Generation Computer Systems, vol.14, issue.5-6, pp.409-424, 1998.
DOI : 10.1016/S0167-739X(98)00043-0

M. Rusinowith and M. Turuani, Protocol Insecurity with Finite Number of Sessions is NP-complete, Computer Security Foundations Workshop (CSFW), pp.174-190, 2001.

F. K. Salem, Factorisation Algorithms for Univariate and Bivariate Polynomials over Finite Fields, Merton College), p.18, 2004.

F. K. Salem and L. T. Yang, Parallel methods for absolute irreducibility testing, The Journal of Supercomputing, vol.33, issue.3, pp.181-212, 2008.
DOI : 10.1007/s11227-008-0205-1

S. Sanjabi and F. Pommereau, Modelling, verification, and formal analysis of security properties in a P2P system, 2010 International Symposium on Collaborative Technologies and Systems, pp.543-548, 2010.
DOI : 10.1109/CTS.2010.5478474

A. Schimpf, S. Merz, and J. Smaus, Construction of Büchi Automata for ltl Model Checking Verified in Isabelle/HOL, Theorem Proving in Higher Order Logics (TPHOLs), p.96, 2009.

S. Seo, E. J. Yoon, J. Kim, S. Jin, J. Kim et al., HAMA: An Efficient Matrix Computation with the MapReduce Framework, 2010 IEEE Second International Conference on Cloud Computing Technology and Science, pp.721-726, 2010.
DOI : 10.1109/CloudCom.2010.17

N. Shankar, Trust and Automation in Verification Tools, Automated Technology for Verification and Analysis (ATVA), pp.4-17, 2008.
DOI : 10.1023/A:1021983302516

N. Shankar and M. Vaucher, The Mechanical Verification of a DPLL-Based Satisfiability Solver, Electronic Notes in Theoretical Computer Science, vol.269, pp.3-17, 2011.
DOI : 10.1016/j.entcs.2011.03.002

S. Sharma, S. Vakkalanka, G. Gopalakrishnan, R. M. Kirby, R. Thakur et al., A Formal Approach to Detect Functionally Irrelevant Barriers in MPI Programs, Recent Advances in pvm and mpi, pp.265-273, 2008.
DOI : 10.1007/3-540-45937-5_16

S. V. Sharma, G. Gopalakrishnan, and R. M. Kirby, A Survey of mpi Related Debuggers and Tools, p.76, 2007.

S. F. Siegel, Verifying Parallel Programs with MPI-Spin, Euro PVM/MPI, pp.13-14, 2007.
DOI : 10.1007/978-3-540-75416-9_8

S. F. Siegel and G. S. Avrunin, Verification of Halting Properties for MPI Programs Using Nonblocking Operations, Recent Advances in pvm and mpi, pp.326-334, 2007.
DOI : 10.1007/978-3-540-75416-9_44

S. F. Siegel, A. M. , G. S. Avrunin, and L. A. Clarke, Combining symbolic execution with model checking to verify parallel numerical programs, ACM Transactions on Software Engineering and Methodology, vol.17, issue.2, pp.1-34, 2008.
DOI : 10.1145/1348250.1348256

S. F. Siegel, A. Mironova, G. S. Avrunin, and L. A. Clarke, Combining symbolic execution with model checking to verify parallel numerical programs, ACM Transactions on Software Engineering and Methodology, vol.17, issue.2, 2008.
DOI : 10.1145/1348250.1348256

S. F. Siegel and T. K. , FEVS: A Functional Equivalence Verification Suite for High-Performance Scientific Computing, Mathematics in Computer Science, vol.97, issue.2, pp.427-435, 2011.
DOI : 10.1007/s11786-011-0101-6

S. F. Siegel and T. K. , TASS: The Toolkit for Accurate Scientific Software, Mathematics in Computer Science, vol.17, issue.2, pp.395-426, 2011.
DOI : 10.1007/s11786-011-0100-7

S. F. Siegel and T. K. , Loop Invariant Symbolic Execution for Parallel Programs, Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.412-427, 2012.
DOI : 10.1007/978-3-642-02658-4_44

M. Snir and W. Gropp, mpi the Complete Reference, Pages, vol.15, pp.17-28, 1998.

D. X. Song, S. Berezin, and A. Perrig, Athena: a novel approach to efficient automatic security protocol analysis1, Journal of Computer Security, vol.9, issue.1-2, pp.47-74, 2001.
DOI : 10.3233/JCS-2001-91-203

C. Sprenger, A verified model checker for the modal ??-calculus in Coq, Tools and Algorithms for Construction and Analysis of Systems (TACAS), pp.167-183, 1998.
DOI : 10.1007/BFb0054171

J. M. Squyres, Zen and the Art of mpi Collectives. ClusterWorld Magazine, mpi Mechanic Column, pp.32-34, 2004.

U. Stern and D. L. Dill, Parallelizing the µrj Verifier. Formal Methods in System Design, pp.117-129, 2001.

A. Stewart, A programming model for BSP with partitioned synchronisation, Formal Aspects of Computing, vol.33, issue.8, pp.421-432, 2011.
DOI : 10.1007/s00165-010-0163-2
URL : https://hal.archives-ouvertes.fr/hal-00624431

A. Stewart, M. Clint, and J. Gabarró, Axiomatic Frameworks for Developing BSP-Style Programs. Parallel Algorithms and Applications, pp.271-292, 2000.

A. Stewart, M. Clint, and J. Gabarró, Barrier Synchronisation: Axiomatisation and Relaxation. Formal Asp, Comput, vol.16, issue.1, pp.36-50, 2004.

A. Stump, D. Oe, A. Reynolds, L. Hadarean, and C. Tinelli, SMT Proof Checking using a Logical Framework. Formal Methods in System Design, pp.91-118, 2013.

J. Sun, Y. Liu, and B. Cheng, Model Checking a Model Checker: A Code Contract Combined Approach, Formal Engineering Methods (ICFEM), pp.518-533, 2010.
DOI : 10.1007/978-3-642-16901-4_34

L. Tan and R. Cleaveland, Evidence-Based Model Checking, Computer Aided Verification (CAV), pp.455-470, 2002.
DOI : 10.1007/3-540-45657-0_37

J. Tesson and F. Loulergue, Formal Semantics for the drma Programming Style Subset of the bsplib Library, Parallel Processing and Applied Mathematics (PPAM), number 4967 in LNCS, pp.1122-1129, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00452540

J. Tesson and F. Loulergue, A Verified Bulk Synchronous Parallel ML Heat Diffusion Simulation, International Conference on Computational Science (ICCS), Procedia Computer Science, pp.36-45, 2011.
DOI : 10.1016/j.procs.2011.04.005
URL : https://hal.archives-ouvertes.fr/hal-00588894

A. Tiskin, The Design and Analysis of Bulk-Synchronous Parallel Algorithms, Pages, vol.18, pp.76-81, 1998.

J. L. Traeff and J. Worringen, Verifying Collective MPI Calls, EuroPVM/MPI conference, p.76, 2004.
DOI : 10.1007/978-3-540-30218-6_11

M. Tsai and B. Wang, Formalization of CTL* in the Calculus of Inductive Constructions Asian computing science conference on Advances in computer science: secure software and related issues, LNCS, vol.4435, pp.316-330, 2007.

E. Turner, M. Butler, and M. Leuschel, A Refinement-Based Correctness Proof of Symmetry Reduced Model Checking, Abstract State Machines, Alloy, B and Z, pp.231-244, 2010.
DOI : 10.1007/978-3-642-11811-1_18

S. Vakkalanka, A. Vo, G. Gopalakrishnan, and R. M. Kirby, Reduced Execution Semantics of MPI: From Theory to Practice, Formal Methods (FM), p.76, 2009.
DOI : 10.1007/978-3-642-05089-3_46

S. S. Vakkalanka, S. Sharma, G. Gopalakrishnan, and R. M. Kirby, ISP, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.285-286, 2008.
DOI : 10.1145/1345206.1345258

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181

L. G. Valiant, A bridging model for multi-core computing, European Symposium on Algorithms (ESA), pp.13-28, 2008.

K. N. Verma, J. Goubault-larrecq, S. Prasad, and S. Arun-kumar, Reflecting BDDs in Coq, Advances in Computing Science -6th Asian Computing Science Conference (ASIAN), pp.162-181, 1961.
DOI : 10.1007/3-540-44464-5_13
URL : https://hal.archives-ouvertes.fr/inria-00072797

J. S. Vetter and B. R. De-supinski, Dynamic Software Testing of MPI Applications with Umpire, ACM/IEEE SC 2000 Conference (SC'00), 2000.
DOI : 10.1109/SC.2000.10055

J. Villard, Heaps and Hops, p.77, 2011.

J. Villard, É. Lozes, and C. Calcagno, Proving Copyless Message Passing, Programming Languages and Systems (APLAS), pp.194-209, 2009.
DOI : 10.1007/978-3-642-10672-9_15

A. Vo, S. Vakkalanka, M. Delisi, G. Gopalakrishnan, R. M. Kirby et al., Formal Verification of Practical mpi Programs, Principles and Practices of Parallel Programming (PPoPP), pp.261-269, 2009.

F. Vogels, B. Jacobs, and F. Piessens, A machine-checked soundness proof for an efficient verification condition generator, Proceedings of the 2010 ACM Symposium on Applied Computing, SAC '10, pp.2517-2522, 2010.
DOI : 10.1145/1774088.1774610

T. L. Williams and R. J. Parsons, The Heterogeneous Bulk Synchronous Parallel Model, Parallel and Distributed Processing (IPDPS), pp.102-108, 2000.
DOI : 10.1007/3-540-45591-4_12

A. N. Yzelman and R. H. Bisseling, An Object-oriented Bulk Synchronous Parallel Library for Multicore Programming Concurrency and Computation: Practice and Experience, pp.533-553, 2012.

A. N. Yzelman, R. H. Bisseling, D. Roose, and K. Meerbergen, MulticoreBSP for C: A High-Performance Library for Shared-Memory Parallel Programming, International Journal of Parallel Programming, vol.24, issue.5, 2013.
DOI : 10.1007/s10766-013-0262-9

A. Zavanella, SKELETONS, BSP AND PERFORMANCE PORTABILITY, Parallel Processing Letters, vol.11, issue.04, pp.393-407, 2001.
DOI : 10.1142/S0129626401000683

J. Zhou and Y. Chen, Generating C Code from LOGS Specifications, International Colloquium on Theoretical Aspects of Computing (ICTAC), pp.195-210, 2005.
DOI : 10.1007/11560647_13

. Bsplib, large-scale-graph-computing-at-google.html 30 NestStep: http://www.ida.liu.se/~chrke/neststep/index.html 31 BSPonGPU: http://kunzhou.net/BSGP/BSGP-package.zip 32 BSP++: https://github.com/khamidouche/BSPPP 33 BSP-Python, 2009.