Y. Afek, A. Matveev, and N. Shavit, Pessimistic Software Lock-Elision, International Symposium on Distributed Computing, pp.297-311978, 2012.
DOI : 10.1007/978-3-642-33651-5_21
URL : http://mcg.cs.tau.ac.il/papers/disc2012-ple.pdf

H. Attiya and E. Hillel, A Single-Version STM that Is Multi-Versioned Permissive, Theory of Computing Systems, vol.26, issue.4, pp.425-446, 2012.
DOI : 10.1145/1122971.1123001

H. Attiya, E. Hillel, and A. Milani, Inherent limitations on disjoint-access parallel implementations of transactional memory, Proceedings of the Twenty-first Annual Symposium on Parallelism in Algorithms and Architectures. pp. 69?78. SPAA '09, 2009.
DOI : 10.1007/s00224-010-9304-5
URL : https://hal.archives-ouvertes.fr/hal-00992693

H. Avni and N. Shavit, Maintaining Consistent Transactional States without a Global Clock, Proceedings of the 15th International Colloquium on Structural Information and Communication Complexity. pp. 131?140. SIROCCO '08, 2008.
DOI : 10.1007/978-3-540-69355-0_12

P. A. Bernstein and N. Goodman, Timestamp-based algorithms for concurrency control in distributed database systems, Proc. of the 6th International Conference on Very Large Data Bases, pp.285-300, 1980.
DOI : 10.21236/ada087996
URL : http://www.dtic.mil/dtic/tr/fulltext/u2/a087996.pdf

A. Cerone and A. Gotsman, Analysing snapshot isolation, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp.55-64, 2016.
DOI : 10.1145/3152396

K. Chan and C. L. Wang, TrC-MC: Decentralized Software Transactional Memory for Multi-multicore Computers, 2011 IEEE 17th International Conference on Parallel and Distributed Systems, pp.292-299, 2011.
DOI : 10.1109/ICPADS.2011.144
URL : http://www.cs.hku.hk/%7Eclwang/papers/icpads-2011-TrC-MC.pdf

D. Dice, O. Shalev, and N. Shavit, Transactional Locking II, Distributed Computing, pp.194-208, 2006.
DOI : 10.1007/11864219_14

D. Dice and N. Shavit, What really makes transactions faster, Proc. of the 1st TRANSACT 2006 workshop, p.3, 2006.

N. Diegues and P. Romano, Time-warp: Lightweight abort minimization in transactional memory, Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. pp. 167?178. PPoPP '14, 2014.

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

F. Ellen, P. Fatourou, E. Kosmas, A. Milani, and C. Travers, Universal constructions that ensure disjoint-access parallelism and wait-freedom, Distributed Computing, vol.26, issue.4, pp.251-277, 2016.
DOI : 10.1145/137097.137873
URL : https://hal.archives-ouvertes.fr/hal-00697198

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

P. Felber, C. Fetzer, P. Marlier, and T. Riegel, Time-Based Software Transactional Memory, IEEE Transactions on Parallel and Distributed Systems, vol.21, issue.12, pp.1793-1807, 2010.
DOI : 10.1109/TPDS.2010.49
URL : https://hal.archives-ouvertes.fr/hal-01240225

S. M. Fernandes and J. Cachopo, Lock-free and scalable multi-version software transactional memory, Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming, pp.179-188, 2011.
DOI : 10.1145/2038037.1941579

R. Guerraoui, T. A. Henzinger, and V. Singh, Permissiveness in Transactional Memories, Distributed Computing, pp.305-319, 2008.
DOI : 10.1007/978-3-540-87779-0_21
URL : https://infoscience.epfl.ch/record/125702/files/main.pdf

R. Guerraoui and M. Kapalka, On the correctness of transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.175-184, 2008.
DOI : 10.1145/1345206.1345233
URL : http://infoscience.epfl.ch/record/136702/files/pldi127-dragojevic.pdf

R. Guerraoui and M. Kapalka, On the correctness of transactional memory, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming , PPoPP '08, pp.175-184, 2008.
DOI : 10.1145/1345206.1345233
URL : http://infoscience.epfl.ch/record/136702/files/pldi127-dragojevic.pdf

R. Guerraoui and M. Kapalka, The semantics of progress in lock-based transactional memory, Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.404-415, 2009.
DOI : 10.1145/1480881.1480931
URL : http://infoscience.epfl.ch/record/130152/files/popl096-kapalka.pdf

S. Hans, A. Hassan, R. Palmieri, S. Peluso, and B. Ravindran, Opacity vs TMS2: Expectations and Reality, Distributed Computing, pp.269-283978, 2016.
DOI : 10.1007/11864219_20

T. Harris and K. Fraser, Revocable locks for non-blocking programming, Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '05, 2005.
DOI : 10.1145/1065944.1065954
URL : http://www.cl.cam.ac.uk/Research/SRG/netos/papers/2005-ppopp-revocable.pdf

A. Hassan, R. Palmieri, and B. Ravindran, Optimistic transactional boosting. SIG- PLAN Not, pp.387-388, 2014.
DOI : 10.1109/tpds.2017.2725837

M. Herlihy, V. Luchangco, M. Moir, I. Scherer, and W. N. , Software transactional memory for dynamic-sized data structures, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, 2003.
DOI : 10.1145/872035.872048
URL : http://www.distcomp.ethz.ch/lectures/fs10/seminar/paper/johannes-1.pdf

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
URL : http://www.cs.uoregon.edu/classes/06W/cis607atom/readings/herlihy-linearizability.pdf

I. Keidar and D. Perelman, On avoiding spare aborts in transactional memory, Proceedings of the Twenty-first Annual Symposium on Parallelism in Algorithms and Architectures. pp. 59?68. SPAA '09, 2009.
DOI : 10.1007/s00224-015-9607-7
URL : http://theory.lcs.mit.edu/~idish/ftp/SpareAbortsTM-TR.pdf

P. Sutra and P. Marlier,

P. Kuznetsov and S. Ravi, Why transactional memory should not be obstruction-free, p.2725, 2015.

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

D. Nguyen and K. Pingali, What scalable programs need from transactional memory, Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems . pp. 105?118. ASPLOS '17, 2017.
DOI : 10.1145/3037697.3037750
URL : http://dl.acm.org/ft_gateway.cfm?id=3037750&type=pdf

D. Perelman, A. Byshevsky, O. Litmanovich, and I. Keidar, SMV: Selective Multi-Versioning STM, Distributed Computing, pp.125-140, 2011.
DOI : 10.1145/1378533.1378583
URL : http://www.ee.technion.ac.il/people/idish/ftp/SMV-full.pdf

S. Ravi, Lower bounds for transactional memory, Bulletin of the EATCS, vol.121, 2017.

T. Riegel, P. Felber, and C. Fetzer, A Lazy Snapshot Algorithm with Eager Validation, Distributed Computing, pp.284-298, 2006.
DOI : 10.1007/11864219_20
URL : http://doc.rero.ch/record/18139/files/Riegel_Torvald_-_A_Lazy_Snapshot_Algorithm_with_Eager_Validation_20100430.pdf

M. F. Spear, V. J. Marathe, I. Scherer, W. N. Scott, and M. L. , Conflict Detection and Validation Strategies for Software Transactional Memory, Distributed Computing, pp.179-193, 2006.
DOI : 10.1007/11864219_13

R. Zhang, Z. Budimli´cbudimli´c, I. Scherer, and W. N. , Commit phase in timestamp-based stm, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, SPAA '08, 2008.
DOI : 10.1145/1378533.1378589
URL : http://www.cs.rice.edu/~zoran/Publications_files/SPAA08.pdf