Single-version STM Can be Multi-version Permissive, Proc. 12th Int'l Conference on Distributed Computing and Networking (ICDCN'11), pp.aaa-bbb, 2011. ,
Consistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms. Chapter, Distributed Systems, pp.55-93, 1993. ,
Formal Aspects of Serializability in Database Concurrency Control, IEEE Transactions on Software Engineering, issue.3, pp.5203-216, 1979. ,
Versioned boxes as the basis for memory transactions, Science of Computer Programming, vol.63, issue.2, pp.172-175, 2006. ,
DOI : 10.1016/j.scico.2006.05.009
Transactions are coming Back, but Are They The Same?, pp.48-58, 2008. ,
Permissiveness in Transactional Memories, Proc. 22th Int'l Symposium on Distributed Computing (DISC'08), pp.305-318, 2008. ,
DOI : 10.1007/978-3-540-87779-0_21
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
Transactional Memory: An Overview, IEEE Micro, vol.27, issue.3, pp.8-29, 2007. ,
DOI : 10.1109/MM.2007.63
Distributed computing and the multicore revolution, ACM SIGACT News, vol.39, issue.1, pp.62-72, 2008. ,
DOI : 10.1145/1360443.1360458
Architectural Support for Lock-free Data Structures, Proc. 20th ACM Int'l Symposium on Computer Archictecture (ISCA'93), pp.289-300, 1993. ,
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
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness, 12th Int'l Conference On Principles Of Distributed Systems (OPODIS'08 Springer-Verlag LNCS #5401, pp.226-245, 2008. ,
DOI : 10.1007/s004460050028
Leveraging Clock and Locks to Favor Commit and Early Abort, 10th Int'l Conference on Distributed Computing and Networking (ICDCN'09 Springer-Verlag LNCS #5408, pp.67-78, 2009. ,
DOI : 10.1007/978-3-540-92295-7_11
URL : https://hal.archives-ouvertes.fr/inria-00281550
A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition, 16th Colloquium on Structural Information and Communication Complexity (SIROCCO'09), pp.266-280, 2009. ,
DOI : 10.1007/s004460050065
URL : https://hal.archives-ouvertes.fr/inria-00440375
Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978. ,
DOI : 10.1145/359545.359563
Lowering the Overhead of Software Transactional Memory, Proc 1rt ACM SIGPLAN Workshop on Languages, Compilers and Hardware Support for Transactional Computing (TRANSACT'06), 2006. ,
The Serializability of Concurrent Updates, Journal of the ACM, vol.26, issue.4, pp.631-653, 1979. ,
On maintaining multiple versions in STM, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.16-25, 2010. ,
DOI : 10.1145/1835698.1835704
Time-based transactional memory with scalable time bases, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '07, pp.221-228, 2007. ,
DOI : 10.1145/1248377.1248415
Software Transactional Memory, Distributed Computing, pp.99-116, 1997. ,
Detecting Causal Relationship in Distributed Computations, Search of the Holy Grail. Distributed Computing, pp.149-174, 1993. ,