Maintaining Consistent Transactional States without a Global Clock, Proc. 15th Colloquium on Structural Information and Communication Complexity (SIROCCO'08), To appear, 2008. ,
DOI : 10.1007/978-3-540-69355-0_12
Transactions are coming Back, but Are They The Same?, pp.48-58, 2008. ,
Toward a Theory of Input Acceptance for Transactional Memories, 2008. ,
DOI : 10.1007/11864219_14
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
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 Protocol for Software Transactional Memory, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00277378
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs, IEEE Transactions on Computers, vol.28, issue.9, pp.690-691, 1979. ,
DOI : 10.1109/TC.1979.1675439
The Serializability of Concurrent Updates, Journal of the ACM, vol.26, issue.4, pp.631-653, 1979. ,
Sequential Consistency as Lazy Linearizability, BA. Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA'02), pp.151-152, 2002. ,
DOI : 10.1007/3-540-36087-5_100
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, vol.10, issue.2, pp.99-116, 1997. ,
DOI : 10.1007/s004460050028
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4743