O. Russel and .. La-programmation-confortable-avec-types-dépendants, 42 3.1.5 Exécution de programmes dans l'assistant de preuve 48 3.1.6 Extraction de programmes, p.57

B. .. De, Diffusion de la chaleur -Implantation à l'aide, p.128

T. Construction-de, 133 8.3.1 Définition, p.136

J. Abrial, The B-Book, 1996.
DOI : 10.1017/CBO9780511624162

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

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. C. Backhouse, An exploration of the Bird-Meertens formalism, STOP Summer School on Constructive Algorithmics, 1988.

J. Backus, Can programming be liberated from the Von Neumann style : A functional style and its algebra of programs, Communications of the ACM, vol.22, issue.8, pp.613-641, 1978.

L. Baduel, F. Baude, D. Caromel, A. Contes, F. Huet et al., Programming, Composing, Deploying for the Grid, Grid Computing : Software Environments and Tools, 2006.
DOI : 10.1007/1-84628-339-6_9

URL : https://hal.archives-ouvertes.fr/inria-00486114

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. Barnett, K. R. Leino, and W. Schulte, The Spec# Programming System: An Overview, Construction and Analysis of Safe, Secure, and Interoperable Smart Devices (CASSIS), pp.49-69, 2004.
DOI : 10.1007/978-3-540-30569-9_3

]. J. Berthold, M. Dieterle, O. Lobachev, and R. Loogen, Parallel FFT with Eden Skeletons, Parallel Computing Technologies, pp.73-83, 2009.
DOI : 10.1145/321450.321457

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

R. Bird, The promotion and accumulation strategies in transformational programming, ACM Transactions on Programming Languages and Systems, vol.6, issue.4, pp.487-504, 1984.
DOI : 10.1145/1780.1781

R. Bird, An Introduction to the Theory of Lists, Logic of Programming and Calculi of Discrete Design, pp.5-42, 1987.
DOI : 10.1007/978-3-642-87374-4_1

R. Bird, Lectures on Constructive Functional Programming, Constructive Methods in Computing Science, number 55 in {NATO} {ASI}, 1988.
DOI : 10.1007/978-3-642-74884-4_5

R. Bird and O. De-moor, Algebra of Programming. International series in computer science, 1997.

R. Bisseling, Parallel Scientific Computation. A structured approach using BSP and MPI, pp.13-14, 2004.

R. H. Bisseling and W. F. Mccoll, Scientific computing on bulk synchronous parallel architectures, Technology and Foundations : Information Processing '94, pp.509-514, 1994.

G. E. Blelloch, Prefix Sums and Their Applications, 1990.

S. Boldo, Floats and Ropes: A Case Study for Formal Numerical Program Verification, 36th International Colloquium on Automata, Languages and Programming (ICALP), pp.91-102, 2009.
DOI : 10.1007/978-3-642-02930-1_8

S. Boldo, F. Clément, J. Filliâtre, M. Mayero, G. Melquiond et al., Formal Proof of a Wave Equation Resolution Scheme: The Method Error, First International Conference on Interactive Theorem Proving (IFP), pp.147-162, 2010.
DOI : 10.1007/978-3-642-14052-5_12

URL : https://hal.archives-ouvertes.fr/inria-00450789

S. Boldo, J. Filliâtre, and G. Melquiond, Combining Coq and Gappa for Certifying Floating-Point Programs, 16th Symposium on Intelligent Computer MathematicsCalculemus ), pp.59-74, 2009.
DOI : 10.1109/TC.2008.200

URL : https://hal.archives-ouvertes.fr/inria-00432726

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

E. Börger and R. Stärk, Abstract State Machines, 2003.
DOI : 10.1007/978-3-642-18216-7

L. Bougé, Le modèle de programmation à parallélisme de données : une perspective sémantique, RAIRO Technique et Science Informatiques, vol.12, issue.5, pp.17-146, 1993.

L. Bougé, The data parallel programming model: A semantic perspective, The Data Parallel Programming Model, pp.4-26, 1996.
DOI : 10.1007/3-540-61736-1_40

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

A. Braud and C. Vrain, A parallel genetic algorithm based on the BSP model, Evolutionary Computation and Parallel Processing GECCO & AAAI Workshop, 1999.

D. Cachera and D. Pichardie, A Certified Denotational Abstract Interpreter, First International Conference on Interactive Theorem Proving, pp.9-24, 2010.
DOI : 10.1007/978-3-642-14052-5_3

URL : https://hal.archives-ouvertes.fr/inria-00537810

D. Cachera and D. Pichardie, Analyse statique par interpr??tation abstraite, Techniques et sciences informatiques, vol.30, issue.4, pp.381-408, 2011.
DOI : 10.3166/tsi.30.381-408

D. Caromel and L. Henrio, A Theory of Distributed Objects, 2004.

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

D. Caromel, L. Henrio, and B. Serpette, Asynchronous and Deterministic Objects, Proceedings of the 31st ACM Symposium on Principles of Programming Languages, pp.123-134, 2004.

A. Cavarra, E. Riccobene, and A. Zavanella, A formal model for the parallel semantics of P3L, Proceedings of the 2000 ACM symposium on Applied computing , SAC '00, pp.804-812, 2000.
DOI : 10.1145/338407.338568

E. Chailloux, P. Manoury, and B. Pagano, Développement d'applications avec Objective Caml, 2000.

A. Chargéraud, Program verification through characteristic formulae, 15th ACM SIGPLAN international conference on Functional programming, pp.321-332, 2010.

Y. Chen and J. W. 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.

E. M. Clarke, O. Grumberg, and D. Peled, Model checking, 2001.

M. Cole, Algorithmic Skeletons, 1989.
DOI : 10.1007/978-1-4471-0841-2_13

M. Cole, PARALLEL PROGRAMMING WITH LIST HOMOMORPHISMS, Parallel Processing Letters, vol.05, issue.02, pp.191-203, 1995.
DOI : 10.1142/S0129626495000175

R. L. Constable, The trimuph of types : Creating a logic of computational reality, Principia Mathematica anniversary symposium, 2011.

P. Corbineau, A Declarative Language for the Coq Proof Assistant, Types for Proofs and Programs, International Conference, pp.69-84, 2007.
DOI : 10.1007/978-3-540-68103-8_5

G. Cousineau and M. Mauny, Approche Fonctionnelle de la Programmation, Ediscience International, 1995.

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, 1977.
DOI : 10.1145/512950.512973

URL : https://hal.archives-ouvertes.fr/inria-00528590

F. Dabrowski and D. Pichardie, A Certified Data Race Analysis for a Java-like Language, LNCS, vol.28, issue.4, pp.212-227, 2009.
DOI : 10.1145/1146809.1146811

URL : https://hal.archives-ouvertes.fr/hal-00465547

S. Dailler, Preuve mécanisée de correction et de complexité pour un algorithme impératif, p.146, 2011.

M. Danelutto, F. Pasqualetti, and S. Pelagatti, Skeletons for data parallelism in p3l, Proceedings of the Third International Euro-Par Conference on Parallel Processing, Euro-Par '97, pp.619-628, 1997.

M. Danelutto and P. Teti, Lithium : A Structured Parallel Programming Environment in Java, Computational Science -ICCS 2002, International Conference Proceedings, Part II, pp.844-853, 2002.

Z. Dargaye, Vérification formelle d'un compilateur pour langages fonctionnels, pp.26-146, 2009.

Z. Dargaye and X. Leroy, A verified framework for higher-order uncurrying optimizations . Higher-Order and Symbolic Computation, pp.199-231, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01499915

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

R. , D. Cosmo, S. Pelagatti, and Z. Li, A calculus for parallel computations over multidimensional dense arrays. Computer Language Structures and Systems, Cité page 24. [56] E. W. Dijkstra. Guarded Commands, Nondeterminacy and Formal Derivation of Programs. CACM, pp.3-482, 1975.
URL : https://hal.archives-ouvertes.fr/hal-00154354

D. C. Dracopoulos and S. Kent, Speeding up genetic programming : A parallel BSP implementation, First Annual Conference on Genetic Programming, 1996.

J. Falcou, K. Hamidouche, and D. Etiemble, Hybrid Bulk Synchronous Parallelism Library for Clustered SMP Architectures, 4th workshop on High-Level Parallel Programming and Applications (HLPP), pp.55-62, 2010.

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

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

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

P. Fradet and J. Mallet, Compilation of a specialized functional language for massively parallel computers, Journal of Functional Programming, vol.10, issue.6, pp.561-605, 2000.
DOI : 10.1017/S0956796800003816

URL : https://hal.archives-ouvertes.fr/inria-00072760

F. Gava, Approches fonctionnelles de la programmation paralléle et des métaordinateurs . Sémantiques, implantations et certification, pp.63-146, 2005.

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

L. Gesbert, Développement systématique et sûreté d'exécution en programmation parallèle structurée, pp.23-63, 2009.

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

S. Glondu, Extraction certifiée dans Coq-en-Coq, Vingtièmes Journées Francophones des Langages Applicatifs of Studia Informatica Universalis, pp.383-410, 2009.

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, Toward reliable and efficient message passing software through formal analysis, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639578

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Gorlatch, Systematic efficient parallelization of scan and other list homomorphisms, p.23
DOI : 10.1007/BFb0024729

A. Gotsman, J. Berdine, B. Cook, N. Rinetzky, and M. Sagiv, Local Reasoning for Storable Locks and Threads, Programming Languages and Systems, pp.19-37, 2007.
DOI : 10.1007/978-3-540-76637-7_3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Granvilliers, G. Hains, Q. Miller, and N. Romero, A system for the high-level parallelization and cooperation of constraint solvers, Proceedings of International Conference on Parallel and Distributed Computing and Systems (PDCS), pp.596-601, 1998.

B. Grégoire and J. L. Sacchini, Combining a Verification Condition Generator for a Bytecode Language with Static Analyses, Trustworthy Global Computing, Third Symposium, pp.23-40, 2007.
DOI : 10.1007/978-3-540-78663-4_4

Y. Gu, B. Lee, and W. Cai, 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

C. Haack, M. Huisman, and C. Hurlin, Permission-based separation logic for multithreaded java programs, pp.13-23, 2011.

T. Hagino, A Categorical Programming Language, 1987.

]. 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

P. Hammarlund and B. Lisper, On the relation between functional and data parallel programming languages, Proceedings of the conference on Functional programming languages and computer architecture , FPCA '93, pp.210-219, 1993.
DOI : 10.1145/165180.165211

T. Hardin, F. Pessaux, P. Weis, and D. Doligez, FoCaLiZe -Reference Manual, 2009.

L. Henrio and F. Kammüller, Functional Active Objects: Typing and Formalisation, Electronic Notes in Theoretical Computer Science, vol.255, pp.83-101, 2009.
DOI : 10.1016/j.entcs.2009.10.026

URL : https://hal.archives-ouvertes.fr/hal-00485759

L. Henrio, F. Kammüller, and B. Lutz, ASPfun : A typed functional active object calculus, Science of Computer Programming, vol.77, issue.7-8, p.24, 2011.
DOI : 10.1016/j.scico.2010.12.008

URL : http://dx.doi.org/10.1016/j.scico.2010.12.008

P. Herms, Certification of a chain for deductive program verification, 2nd Coq Workshop, satellite of ITP'10, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00535640

M. Hidalgo-herrero and Y. Ortega-mallén, AN OPERATIONAL SEMANTICS FOR THE PARALLEL LANGUAGE EDEN, Parallel Processing Letters, vol.12, issue.02, pp.211-228, 2002.
DOI : 10.1142/S0129626402000938

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

K. Hinsen, High-Level Parallel Software Development with Python and BSP. Parallel Processing Letters, pp.461-472, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00015424

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=

J. Holzmann, The model checker SPIN, IEEE Transactions on Software Engineering, vol.23, issue.5, 2004.
DOI : 10.1109/32.588521

G. Horvitz and R. H. Bisseling, Designing a BSP version of ScaLAPACK, Proceedings Ninth SIAM Conference on Parallel Processing for Scientific Computing. SIAM, 1999.

Z. Hu, Towards Systematic Derivation of BSP Parallel Algorithms Workshop on Parallelism Oblivious Programming, pp.15-23, 2007.

N. Javed and F. Loulergue, A Formal Programming Model of Orl??ans Skeleton Library, 11th International Conference on Parallel Computing Technologies (PaCT), pp.2011-2034
DOI : 10.1007/3-540-59451-5_2

N. Javed and F. Loulergue, Parallel Programming and Performance Predictability with Orléans Skeleton Library, International Conference on High Performance Computing and Simulation (HPCS), pp.257-263

N. Javed and F. Loulergue, Verification of a Heat Diffusion Simulation Written with Orl??ans Skeleton Library, 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011.
DOI : 10.1007/978-3-642-31500-8_10

C. B. Jones, Tentative steps toward a development method for interfering programs, ACM Transactions on Programming Languages and Systems, vol.5, issue.4, pp.596-619, 1983.
DOI : 10.1145/69575.69577

Y. Kee and S. Ha, An Efficient Implementation of the BSP Programming Library for VIA. Parallel Processing Letters, pp.65-77, 2002.

C. Koelbel, D. Loveman, R. Schreiber, G. Steele, and M. Zosel, The High Performance Fortran Handbook, Computers in Physics, vol.8, issue.4, 1994.
DOI : 10.1063/1.4823319

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

M. Leyton, L. Henrio, and J. M. Piquer, Exceptions for Algorithmic Skeletons, 16th International Euro-Par Conference, pp.14-25, 2010.
DOI : 10.1007/978-3-642-15291-7_3

URL : https://hal.archives-ouvertes.fr/hal-00486108

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

R. Loogen, Y. Ortega-mallén, and R. Peña-marí, Parallel functional programming in Eden, Journal of Functional Programming, vol.15, issue.3, pp.431-475, 2005.
DOI : 10.1017/S0956796805005526

F. Loulergue, F. Gava, and D. Billiet, Bulk Synchronous Parallel ML: Modular Implementation and Performance Prediction, International Conference on Computational Science (ICCS), pp.1046-1054, 2005.
DOI : 10.1007/11428848_132

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

]. G. Malcolm, Data structures and program transformation, Science of Computer Programming, vol.14, issue.2-3, pp.255-279, 1990.
DOI : 10.1016/0167-6423(90)90023-7

URL : http://doi.org/10.1016/0167-6423(90)90023-7

K. Matsuzaki and K. Emoto, Implementing Fusion-Equipped Parallel Skeletons by Expression Templates, 21st International Workshop on Implementation and Application of Functional Languages (IFL), 2009.
DOI : 10.1007/978-3-642-16478-1_5

K. Matsuzaki, Z. Hu, K. Kakehi, and M. Takeichi, SYSTEMATIC DERIVATION OF TREE CONTRACTION ALGORITHMS, Parallel Processing Letters, vol.15, issue.03, pp.321-336, 2005.
DOI : 10.1142/S0129626405002246

K. Matsuzaki, H. Iwasaki, K. Emoto, and Z. Hu, A library of constructive skeletons for sequential style of parallel programming, Proceedings of the 1st international conference on Scalable information systems , InfoScale '06, 2006.
DOI : 10.1145/1146847.1146860

W. F. Mccoll, Universal computing, Bougé et al. [27]. Cité page 13
DOI : 10.1007/3-540-61626-8_3

L. Meertens, Algorithmics ? Towards Programming as a Mathematical Activity, Proceedings of CWI Symposium on Mathematics and Computer Science, pp.289-334, 1986.

L. Meertens, First Steps Towards the Theory of Rose Trees. CWI, Amsterdam, IFIP Working Group 2.1 Working paper 592 ROM-25, 1988.

Q. Miller, BSP in a Lazy Functional Context, Trends in Functional Programming, 2002.

A. Morihata, K. Matsuzaki, Z. H. Hu, and M. Takeichi, The third homomorphism theorem on trees : downward & upward lead to divide-and-conquer, Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.177-185, 2009.

K. Morita, A. Morihata, K. Matsuzaki, Z. Hu, and M. Takeichi, Automatic Inversion Generates Divide-and-Conquer Parallel Programs, ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, pp.146-155, 2007.

S. Mu, H. Ko, and P. Jansson, Algebra of Programming Using Dependent Types, Mathematics of Program Construction, pp.268-283, 2008.
DOI : 10.1007/978-3-540-70594-9_15

A. Nanevski, G. Morrisett, A. Shinnar, P. Govereau, and L. Birkedal, Ynot : dependent types for imperative programs, 13th ACM SIGPLAN international conference on Functional programming, pp.229-240, 2008.

B. Nichols, D. Buttlar, and J. Farrell, Pthreads Programming : A POSIX Standard for Better Multiprocessing, 1996.

T. Nipkow, D. Oheimb, and C. Pusch, µJava : Embedding a programming language in a theorem prover, Foundations of Secure Computation NATO Science Series F : Computer and Systems Sciences, pp.117-144, 2000.

P. W. Ohearn, Resources, concurrency, and local reasoning, Theoretical Computer Science, vol.375, issue.1-3, pp.271-307, 2007.
DOI : 10.1016/j.tcs.2006.12.035

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

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

A. Schimpf, S. Merz, and J. Smaus, Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL, LNCS, vol.5674, pp.424-439, 2009.

S. F. Siegel, Verifying Parallel Programs with MPI-Spin, Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI 2007), pp.13-14, 2007.
DOI : 10.1007/978-3-540-75416-9_8

S. F. Siegel and G. S. Avrunin, Verification of MPI-Based Software for Scientific Computation, Model Checking Software, 11th International SPIN Workshop, pp.286-303, 2004.
DOI : 10.1007/978-3-540-24732-6_20

S. F. Siegel and G. S. Avrunin, Modeling wildcard-free MPI programs for verification, Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '05, pp.95-106, 2005.
DOI : 10.1145/1065944.1065957

D. Skillicorn, Parallelism and the Bird-Meertens Formalism. FTP from qucis .queensu.ca in /pub/skill, 1992.

D. B. Skillicorn, Foundations of Parallel Programming. Number 6 in International Series on Parallel Computation, 1994.

M. Snir and W. Gropp, MPI the Complete Reference, 1998.

M. Sozeau, Un environnement pour la programmation avec types dépendants, pp.42-51, 2008.

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 and M. Clint, BSP-style Computation: a Semantic Investigation, The Computer Journal, vol.44, issue.3, pp.174-185, 2001.
DOI : 10.1093/comjnl/44.3.174

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 Aspects of Computing, vol.16, issue.1, pp.36-50, 2004.
DOI : 10.1007/s00165-004-0028-7

J. Tesson, H. Hashimoto, Z. Hu, F. Loulergue, and M. Takeichi, Program Calculation in Coq, Thirteenth International Conference on Algebraic Methodology And Software Technology (AMAST2010), pp.163-179, 2010.
DOI : 10.1145/1596614.1596616

URL : https://hal.archives-ouvertes.fr/inria-00448751

J. Tesson and F. Loulergue, A Verified Bulk Synchronous Parallel ML Heat Diffusion Simulation, 11th International Conference on Computational Science Procedia Computer Science, pp.36-45, 2011.
DOI : 10.1016/j.procs.2011.04.005

URL : https://hal.archives-ouvertes.fr/hal-00588894

S. The and . Team, Program Calculation In Coq, 2011.

C. Guide, Thinking Machine Corporation, 1990.

V. Vafeiadis and M. Parkinson, A Marriage of Rely/Guarantee and Separation Logic, CONCUR 2007 ? Concurrency Theory, pp.256-271, 2007.
DOI : 10.1007/978-3-540-74407-8_18

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, p.103, 1990.
DOI : 10.1145/79173.79181

E. Van-der-weegen and J. Mckinna, A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq, Types for Proofs and Programs, International Conference, pp.256-271, 2008.
DOI : 10.1007/11783596_6

E. Violard, A semantic framework to address data locality in data parallel languages, Parallel Computing, vol.30, issue.1, pp.139-161, 2004.
DOI : 10.1016/S0167-8191(03)00089-9

E. Violard, S. Genaud, and G. Perrin, Refinement of data parallel programs in PEI, 1997.
DOI : 10.1007/978-0-387-35264-0_5

P. Wadler and S. Blott, How to make ad-hoc polymorphism less ad hoc, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.60-76, 1989.
DOI : 10.1145/75277.75283

Y. Yang, X. Chen, G. Gopalakrishnan, and R. M. Kirby, Efficient Stateful Dynamic Partial Order Reduction, Model Checking Software, 15th International SPIN Workshop, pp.288-305, 2008.
DOI : 10.1007/978-3-540-85114-1_20

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=