H. G. Baker and J. , List processing in real time on a serial computer, Communications of the ACM, vol.21, issue.4, p.21
DOI : 10.1145/359460.359470

M. Batty, S. Owens, S. Sarkar, P. Sewell, and T. Weber, Mathematizing C++ concurrency, Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.55-66, 2011.
DOI : 10.1145/1925844.1926394

URL : http://www.cl.cam.ac.uk/%7Ess726/papers/c%2B%2B-popl11.pdf

M. Batty, M. Dodds, and A. Gotsman, Library abstraction for C/C++ concurrency, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '13, pp.235-248
DOI : 10.1145/2429069.2429099

URL : http://kar.kent.ac.uk/50270/1/POPL.13.library_abstraction_c_cpp.pdf

R. D. Blumofe and C. E. Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM, vol.46, issue.5, pp.720-748, 1999.
DOI : 10.1145/324133.324234

URL : http://csdl.computer.org/comp/proceedings/sfcs/1994/6580/00/0365680.pdf

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall et al., Cilk: An efficient multithreaded runtime system, Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP '95, pp.207-216, 1995.
DOI : 10.1006/jpdc.1996.0107

URL : http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TM-548.pdf

A. Braginsky, A. Kogan, and E. Petrank, Drop the anchor, Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures, SPAA '13, pp.33-42
DOI : 10.1145/2486159.2486184

A. Buttari, J. Langou, J. Kurzak, and J. Dongarra, A class of parallel tiled linear algebra algorithms for multicore architectures, Parallel Computing, vol.35, issue.1, pp.38-53, 2009.
DOI : 10.1016/j.parco.2008.10.002

P. Caspi, D. Pilaud, N. Halbwachs, and J. A. Plaice, LUSTRE: a declarative language for real-time programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.178-188, 1987.
DOI : 10.1145/41625.41641

D. Chase and Y. Lev, Dynamic circular work-stealing deque, Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures , SPAA'05, pp.21-28, 2005.
DOI : 10.1145/1073970.1073974

E. A. De-kock, W. J. Smits, P. Van-der-wolf, J. Brunel, W. M. Kruijtzer et al., YAPI, Proceedings of the 37th conference on Design automation , DAC '00, pp.402-405, 2000.
DOI : 10.1145/337292.337511

M. Desnoyers, P. E. Mckenney, A. S. Stern, M. R. Dagenais, and J. Walpole, User-Level Implementations of Read-Copy Update, IEEE Transactions on Parallel and Distributed Systems, vol.23, issue.2, pp.375-382, 2012.
DOI : 10.1109/TPDS.2011.159

E. W. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, vol.8, issue.9, p.569, 1965.
DOI : 10.1145/365559.365617

T. L. Harris, K. Fraser, and I. A. Pratt, A Practical Multi-word Compare-and-Swap Operation, Proceedings of the 16th International Conference on Distributed Computing, DISC '02, pp.265-279, 2002.
DOI : 10.1007/3-540-36108-1_18

URL : http://www.cl.cam.ac.uk/Research/SRG/netos/papers/2002-casn.ps

M. Herlihy, V. Luchangco, and M. Moir, The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures, 2002.
DOI : 10.1007/3-540-36108-1_23

M. P. Herlihy, Impossibility and universality results for wait-free synchronization, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.276-290, 1988.
DOI : 10.1145/62546.62593

URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=2796&context=compsci

M. P. Herlihy, A methodology for implementing highly concurrent data structures, Proceedings of the Second ACM SIGPLAN Symposium on Principles &Amp; Practice of Parallel Programming, PPOPP '90, pp.197-206, 1990.
DOI : 10.1145/99163.99185

URL : http://www.cs.utexas.edu/~lorenzo/corsi/cs380d/papers/p745-herlihy.pdf

M. P. Herlihy and J. M. Wing, Axioms for concurrent objects, Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp.13-26, 1987.
DOI : 10.21236/ada200584

URL : http://www.dtic.mil/dtic/tr/fulltext/u2/a200584.pdf

M. P. Herlihy, V. Luchangco, and M. Moir, Obstruction-free synchronization: double-ended queues as an example, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., p.522, 2003.
DOI : 10.1109/ICDCS.2003.1203503

URL : http://research.sun.com/people/moir/Papers/ICDCS2003.pdf

G. Kahn, The semantics of a simple language for parallel programming, Proceedings of IFIP 74, pp.471-475, 1974.

G. Kahn and D. B. Macqueen, Coroutines and networks of parallel processes, Proceedings of IFIP 77, pp.993-998, 1977.
URL : https://hal.archives-ouvertes.fr/inria-00306565

O. Lahav and V. Vafeiadis, Owicki-Gries Reasoning for Weak Memory Models, Proceedings , Part II of the 42Nd International Colloquium on Automata, Languages, and Programming, pp.311-323, 2015.
DOI : 10.1007/978-3-662-47666-6_25

L. Lamport, Proving the Correctness of Multiprocess Programs, IEEE Transactions on Software Engineering, vol.3, issue.2, pp.125-143, 1977.
DOI : 10.1109/TSE.1977.229904

N. M. Lê, A. Guatto, A. Cohen, and A. Pop, Correct and Efficient Bounded FIFO Queues, 2013 25th International Symposium on Computer Architecture and High Performance Computing, pp.144-151, 2013.
DOI : 10.1109/SBAC-PAD.2013.8

N. M. Lê, A. Pop, A. Cohen, and F. Z. Nardelli, Correct and efficient work-stealing for weak memory models, Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '13, pp.69-80

E. A. Lee and D. G. Messerschmitt, Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing, IEEE Transactions on Computers, vol.36, issue.1, pp.24-35, 1987.
DOI : 10.1109/TC.1987.5009446

P. P. Lee, T. Bu, and G. Chandranmenon, A lock-free, cache-efficient shared ring buffer for multi-core architectures, Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS '09, pp.78-79, 2009.
DOI : 10.1145/1882486.1882508

P. E. Mckenney and J. D. Slingwine, Read-copy-update: Using execution history to solve concurrency problems, Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS '98, pp.509-518, 1998.

M. M. Michael, Safe memory reclamation for dynamic lock-free objects using atomic reads and writes, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.21-30, 2002.
DOI : 10.1145/571825.571829

M. M. Michael and M. L. Scott, Simple, fast, and practical non-blocking and blocking concurrent queue algorithms, Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '96, pp.267-275, 1996.
DOI : 10.1145/248052.248106

URL : https://www.researchgate.net/profile/Michael_Scott6/publication/2804621_Simple_Fast_and_Practical_Non-Blocking_and_Blocking_Concurrent_Queue_Algorithms/links/00b7d5143281ae37fa000000.pdf

P. W. O-'hearn, Resources, concurrency, and local reasoning, Theor. Comput. Sci, vol.375, issue.1-3, pp.271-307, 2007.

P. W. O-'hearn, N. Rinetzky, M. T. Vechev, E. Yahav, and G. Yorsh, Verifying linearizability with hindsight, Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp.85-94

G. L. Peterson, Myths about the mutual exclusion problem, Information Processing Letters, vol.12, issue.3, pp.115-116, 1981.
DOI : 10.1016/0020-0190(81)90106-X

J. Planas, R. M. Badia, E. Ayguadé, and J. Labarta, Hierarchical Task-Based Programming With StarSs, The International Journal of High Performance Computing Applications, vol.17, issue.1, pp.284-299, 2009.
DOI : 10.1109/5.476078

A. Pop and A. Cohen, OpenStream, ACM Transactions on Architecture and Code Optimization, vol.9, issue.4, pp.1-53, 2013.
DOI : 10.1145/2400682.2400712

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

W. Thies, M. Karczmarek, and S. P. Amarasinghe, StreamIt: A Language for Streaming Applications, Proceedings of the 11th International Conference on Compiler Construction, CC '02, pp.179-196, 2002.
DOI : 10.1007/3-540-45937-5_14

URL : http://www.cag.lcs.mit.edu/~thies/papers/streamit-cc.pdf

S. Timnat and E. Petrank, A practical wait-free simulation for lock-free data structures, Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp.357-368
DOI : 10.1145/2692916.2555261

R. K. Treiber, Systems programming: Coping with parallelism, 1986.

A. Turon, V. Vafeiadis, and D. Dreyer, GPS: Navigating weak memory with ghosts, protocols, and separation, Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA '14, pp.691-707

V. Vafeiadis and C. Narayan, Relaxed Separation Logic: A program logic for C11 concurrency, Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA '13, pp.867-884
DOI : 10.1145/2509136.2509532

V. Vafeiadis, T. Balabonski, S. Chakraborty, R. Morisset, and F. Z. Nardelli, Common compiler optimisations are invalid in the C11 memory model and what we can do about it, Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '15, pp.209-220
URL : https://hal.archives-ouvertes.fr/hal-01089047

J. D. Valois, Lock-free linked lists using compare-and-swap, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, pp.214-222, 1995.
DOI : 10.1145/224964.224988

URL : http://www.cs.brown.edu/courses/cs295h/valois.ps

H. Vandierendonck, K. Chronaki, and D. S. Nikolopoulos, Deterministic scale-free pipeline parallelism with hyperqueues Networking, Storage and Analysis, SC '13, Proceedings of the International Conference on High Performance Computing, pp.1-32
DOI : 10.1145/2503210.2503233

URL : https://pure.qub.ac.uk/portal/files/11663999/postprint.pdf