Specifying Concurrent Problems: Beyond Linearizability and up to Tasks, DISC 2015, Proceedings, pp.420-435, 2015. ,
Modular Verification of ConcurrencyAware Linearizability, DISC 2015, Proceedings, pp.371-387, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01207126
Distributed Computing Through Combinatorial Topology, 2013. ,
Linearizability: A Correctness Condition for Concurrent Objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990. ,
How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Transactions on Computers, vol.28, issue.9, pp.690-691, 1979. ,
, Leslie Lamport. On interprocess communication. Distributed Computing, vol.1, issue.2, pp.77-85, 1986.
Reduction: A method of proving properties of parallel programs, Communications of the ACM, vol.18, issue.12, pp.717-721, 1975. ,
Axioms for memory access in asynchronous hardware systems, Seminar on Concurrency, pp.96-110, 1985. ,
Set-Linearizability, Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, p.396, 1994. ,
The serializability of concurrent database updates, Journal of the ACM, vol.26, issue.4, pp.631-653, 1979. ,
From serializable to causal transactions for collaborative applications, Proceedings of the 23rd EUROMICRO, pp.314-321, 1997. ,
URL : https://hal.archives-ouvertes.fr/inria-00073888