. Forkcb-(-?, ? ?e, isInBlock ? (t, forkCB(e), pos) general

M. Abadi, A. Birrell, T. Harris, and M. Isard, Semantics of transactional memory and automatic mutual exclusion, POPL, pp.63-74, 2008.

A. Adl-tabatabai, B. T. Lewis, V. Menon, B. R. Murphy, B. Saha et al., Compiler and runtime support for efficient software transactional memory, ACM SIGPLAN Notices, vol.41, issue.6, pp.26-37, 2006.
DOI : 10.1145/1133255.1133985

Y. Afek, G. Korland, and A. Zilberstein, Lowering STM Overhead with Static Analysis, Languages and Compilers for Parallel Computing, pp.31-45, 2011.
DOI : 10.1007/978-3-540-24644-2_25

K. Agrawal, J. T. Fineman, and J. Sukha, Nested parallelism in transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.163-174, 2008.
DOI : 10.1145/1345206.1345232

G. Almasi, PGAS (partitioned global address space) languages, Encyclopedia of Parallel Computing, pp.1539-1545

E. Ayguadé, N. Copty, A. Duran, J. Hoeflinger, Y. Lin et al., The Design of OpenMP Tasks, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.3, pp.404-418, 2009.
DOI : 10.1109/TPDS.2008.105

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

G. Barthe, D. Demange, and D. Pichardie, Formal Verification of an SSA-Based Middle-End for CompCert, ACM Transactions on Programming Languages and Systems, vol.36, issue.1, pp.1-4, 2014.
DOI : 10.1145/2579080
URL : https://hal.archives-ouvertes.fr/hal-01097677

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

A. Bieniusa and P. Thiemann, Proving Isolation Properties for Software Transactional Memory, LNCS, vol.115, issue.1, pp.38-56
DOI : 10.1006/inco.1994.1093

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. Boldo, J. Jourdan, X. Leroy, and G. Melquiond, A Formally-Verified C Compiler Supporting Floating-Point Arithmetic, 2013 IEEE 21st Symposium on Computer Arithmetic, pp.107-115, 2013.
DOI : 10.1109/ARITH.2013.30
URL : https://hal.archives-ouvertes.fr/hal-00743090

P. B. Hansen, The origin of concurrent programming, chapter The invention of concurrent programming, pp.3-61, 2002.

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

C. Cascaval, C. Blundell, M. Michael, H. W. Cain, P. Wu et al., Software transactional memory, Communications of the ACM, vol.51, issue.11, pp.5140-5186, 2008.
DOI : 10.1145/1400214.1400228

B. L. Chamberlain, D. Callahan, and H. P. Zima, Parallel Programmability and the Chapel Language, International Journal of High Performance Computing Applications, vol.21, issue.3, pp.291-312, 2007.
DOI : 10.1177/1094342007078442

B. Chapman, T. Curtis, S. Pophale, S. Poole, J. Kuehn et al., Introducing OpenSHMEM, Proceedings of the Fourth Conference on Partitioned Global Address Space Programming Model, PGAS '10, 2010.
DOI : 10.1145/2020373.2020375

A. Chlipala, An Introduction to Programming and Proving with Dependent Types in Coq, Journal of Formalized Reasoning, vol.3, issue.2, pp.2010-2019

A. Chlipala, A verified compiler for an impure functional language, POPL, pp.93-106, 2010.

A. Chlipala, Certified Programming with Dependent Types, 2014.

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

T. Coquand and G. Huet, The calculus of constructions, Information and Computation, vol.76, issue.2-3, 1988.
DOI : 10.1016/0890-5401(88)90005-3
URL : https://hal.archives-ouvertes.fr/inria-00076024

C. Inc, Chapel Language Specification Version 0, 2013.

D. Cunningham, S. Drossopoulou, and S. Eisenbach, Lock Inference Proven Correct, Formal Techniques for Java-like Programs, 2008.

D. Cunningham, K. Gudka, and S. Eisenbach, Keep Off the Grass: Locking the Right Path for Atomicity, Compiler Construction, pp.276-290, 2008.
DOI : 10.1007/978-3-540-78791-4_19

P. Damron, A. Fedorova, Y. Lev, V. Luchangco, M. Moir et al., Hybrid transactional memory, ASPLOS XII, pp.336-346, 2006.

Z. Dargaye, Vérification formelle d'un compilateur optimisant pour langages fonctionnels, 2009.

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

M. A. Dave, Compiler verification, ACM SIGSOFT Software Engineering Notes, vol.28, issue.6, pp.2-2, 2003.
DOI : 10.1145/966221.966235

J. Dean and S. Ghemawat, MapReduce, OSDI, pp.137-150, 2004.
DOI : 10.1145/1327452.1327492

E. W. Dijkstra, The origin of concurrent programming, chapter Cooperating sequential processes, pp.65-138, 2002.

A. Dragojevi´cdragojevi´c, P. Felber, V. Gramoli, and R. Guerraoui, Why STM can be more than a research toy, Communications of the ACM, vol.54, issue.4, pp.70-77, 2011.
DOI : 10.1145/1924421.1924440

U. Drepper, Parallel programming with transactional memory, Communications of the ACM, vol.52, issue.2, pp.38-43, 2009.
DOI : 10.1145/1461928.1461943

R. Ennals, Software transactional memory should not be obstruction-free, 2006.

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.

J. Gray, The transaction concept: Virtues and limitations, VLDB, pp.144-154, 1981.

D. Grove, O. Tardieu, D. Cunningham, B. Herta, I. Peshansky et al., A performance model for X10 applications, Proceedings of the 2011 ACM SIGPLAN X10 Workshop on, X10 '11, pp.1-8, 2011.
DOI : 10.1145/2212736.2212737

R. L. Halpert, C. J. Pickett, and C. Verbrugge, Component-Based Lock Allocation, 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), pp.353-364, 2007.
DOI : 10.1109/PACT.2007.4336225

T. Harris and K. Fraser, Language support for lightweight transactions, ACM SIGPLAN Notices, vol.38, issue.11, pp.388-402, 2003.
DOI : 10.1145/949343.949340

T. Harris, S. Marlow, S. Peyton-jones, and M. Herlihy, Composable memory transactions, PPoPP, pp.48-60, 2005.

M. Herlihy, V. Luchangco, and M. Moir, A flexible framework for implementing software transactional memory, OOPSLA, pp.253-262, 2006.

M. Herlihy, V. Luchangco, M. Moir, W. N. Scherer, and I. , Software transactional memory for dynamic-sized data structures, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, pp.92-101, 2003.
DOI : 10.1145/872035.872048

M. Herlihy and J. E. Moss, Transactional memory, ACM SIGARCH Computer Architecture News, vol.21, issue.2, pp.289-300, 1993.
DOI : 10.1145/173682.165164

M. P. Herlihy and J. M. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990.
DOI : 10.1145/78969.78972

M. Hicks, J. S. Foster, and P. Pratikakis, Lock inference for atomic sections, In Transact, 2006.

C. Hoare, Towards a theory of parallel programming, Operating Systems Techniques, 1972.

A. Hobor, A. W. Appel, and F. Z. Nardelli, Oracle Semantics for Concurrent Separation Logic, number 4960 in LNCS, pp.353-367, 2008.
DOI : 10.1007/978-3-540-78739-6_27

W. A. Howard, The formulae-as-types notion of construction, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.479-490, 1980.

S. Jagannathan, J. Vitek, A. Welc, and A. Hosking, A transactional object calculus, Science of Computer Programming, vol.57, issue.2, pp.164-186, 2005.
DOI : 10.1016/j.scico.2005.03.001

G. Klein and T. Nipkow, A machine-checked model for a Java-like language, virtual machine, and compiler, ACM Transactions on Programming Languages and Systems, vol.28, issue.4, pp.619-695, 2006.
DOI : 10.1145/1146809.1146811

G. Korland, N. Shavit, and P. Felber, Noninvasive concurrency with Java STM. MultiProg'10 : Programmability Issues for Heterogeneous Multicores, 2010.

E. Koskinen, M. Parkinson, and M. Herlihy, Coarse-grained transactions, POPL, pp.19-30, 2010.

J. Larus and C. Kozyrakis, Transactional memory, Communications of the ACM, vol.51, issue.7, pp.80-88, 2008.
DOI : 10.1145/1364782.1364800

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, 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

X. Leroy and S. Blazy, Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations, Journal of Automated Reasoning, vol.17, issue.5???6, pp.1-31, 2008.
DOI : 10.1007/s10817-008-9099-0
URL : https://hal.archives-ouvertes.fr/inria-00289542

M. Leyton, Advanced features for algorithmic skeleton programming, 2008.

A. Lochbihler, Verifying a Compiler for Java Threads, ESOP, number 6012 in LNCS, pp.427-447, 2010.
DOI : 10.1007/978-3-642-11957-6_23

M. Martin, C. Blundell, and E. Lewis, Subtleties of transactional memory atomicity semantics, IEEE Comput. Archit. Lett, vol.5, issue.2, pp.17-17, 2006.

J. Mccarthy and J. Painter, Correctness of a compiler for arithmetic expressions, Proceedings of Symposium in Applied Mathematics, pp.33-41, 1967.
DOI : 10.1090/psapm/019/0242403

B. Mccloskey, F. Zhou, D. Gay, and E. Brewer, Autolocker: synchronization inference for atomic sections, POPL, pp.346-358, 2006.

D. Mccracken, POSIX threads and the linux kernel, Ottawa Linux Symposium, pp.330-337, 2002.

K. F. Moore and D. Grossman, High-level small-step operational semantics for transactions, POPL, pp.51-62, 2008.

J. E. Moss and A. L. Hosking, Nested transactional memory: Model and architecture sketches, Science of Computer Programming, vol.63, issue.2, pp.186-201, 2006.
DOI : 10.1016/j.scico.2006.05.010

N. Hilfinger, D. Bonachea, K. Datta, D. Gay, S. Graham et al., Titanium Language Reference Manual Version 2, 2006.

H. R. Nielson and F. Nielson, Semantics with Applications ? An Appetizer, 2007.
DOI : 10.1007/978-1-84628-692-6

T. Nipkow, L. C. Paulson, and M. Wenzel, Isabelle/HOL ? A Proof Assistant for Higher-Order Logic, LNCS 2283, p.34, 2002.

R. Nishtala, G. Almási, and C. Cascaval, Performance without pain = productivity, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.99-110, 2008.
DOI : 10.1145/1345206.1345224

R. W. Numrich and J. Reid, Co-array Fortran for parallel programming, ACM SIGPLAN Fortran Forum, vol.17, issue.2, pp.1-31, 1998.
DOI : 10.1145/289918.289920

C. H. Papadimitriou, The serializability of concurrent database updates, Journal of the ACM, vol.26, issue.4, pp.631-653, 1979.
DOI : 10.1145/322154.322158

S. Pelagatti, Structured Development of Parallel Programs, 1998.

C. Perfumo, N. Sönmez, S. Stipic, O. Unsal, A. Cristal et al., The limits of software transactional memory (STM), Proceedings of the 2008 conference on Computing frontiers , CF '08, pp.67-78, 2008.
DOI : 10.1145/1366230.1366241

F. A. Rabhi and S. Gorlatch, Patterns and Skeletons for Parallel and Distributed Computing, 2003.
DOI : 10.1007/978-1-4471-0097-3

J. Sevcík, V. Vafeiadis, F. Z. Nardelli, S. Jagannathan, and P. Sewell, Comp- CertTSO: A Verified Compiler for Relaxed-Memory Concurrency, Journal of the ACM, vol.60, issue.3, pp.22-34, 2013.

J. Sevcik, V. Vafeiadis, F. Zappa-nardelli, S. Jagannathan, and P. Sewell, Relaxed- Memory Concurrency and Verified Compilation, POPL, pp.43-54
URL : https://hal.archives-ouvertes.fr/hal-00907801

P. Sewell, S. Sarkar, S. Owens, F. Z. Nardelli, and M. O. Myreen, x86-TSO, Communications of the ACM, vol.53, issue.7, pp.89-97, 2010.
DOI : 10.1145/1785414.1785443

N. Shavit and D. Touitou, Software transactional memory, PODC, pp.204-213, 1995.

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

U. Consortium, UPC language specifications version 1.2, 2005.

V. Saraswat, B. Bloom, I. Peshansky, O. Tardieu, and D. Grove, X10 language specification version 2.3, 2013.