The renaming problem: recent developments and open questions, Bull. EATCS, vol.3, p.117, 2015. ,
Revisiting snapshot algorithms by refinement-based techniques, Comput. Sci. Inf. Syst, vol.11, issue.1, pp.251-270, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00734131
Tight bounds for adopt-commit objects, Theory Comput. Syst, vol.55, issue.3, pp.451-474, 2014. ,
Renaming in an asynchronous environment, J. ACM, vol.37, issue.3, pp.524-548, 1990. ,
Generalized FLP impossibility result for t-resilient asynchronous computations, STOC 1993: Proceedings of the ACM Symposium on Theory of computing, pp.91-100, 1993. ,
The BG distributed simulation algorithm, Distrib. Comput, vol.14, issue.3, pp.127-146, 2001. ,
, Tasks in modular proofs of concurrent algorithms. CoRR, 2019.
The renaming problem in shared memory systems: an introduction, Comput. Sci. Rev, vol.5, issue.3, pp.229-251, 2011. ,
Unifying concurrent objects and distributed tasks: interval-linearizability, J. ACM, vol.65, issue.6, p.45, 2018. ,
More choices allow more faults: set consensus problems in totally asynchronous systems, Inf. Comput, vol.105, issue.1, pp.132-158, 1993. ,
Cubicle: a parallel SMTbased model checker for parameterized systems, CAV 2012, vol.7358, pp.718-724, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00799272
Automatic linearizability proofs of concurrent objects with cooperating updates, CAV 2013, vol.8044, pp.174-190, 2013. ,
Round-by-round fault detectors: unifying synchrony and asynchrony (extended abstract), Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp.143-152, 1998. ,
MCMT: a model checker modulo theories, IJCAR 2010. LNCS (LNAI), vol.6173, pp.22-29, 2010. ,
A simplicial complex model for dynamic epistemic logic to study distributed task computability, Ninth International Symposium on Games, Automata, Logics, and Formal Verification, pp.73-87, 2018. ,
Modular verification of concurrency-aware linearizability, DISC 2015, vol.9363, pp.371-387 ,
URL : https://hal.archives-ouvertes.fr/hal-01207126
, , 2015.
A scalable lock-free stack algorithm, J. Parallel Distrib. Comput, vol.70, issue.1, pp.1-12, 2010. ,
Distributed Computing Through Combinatorial Topology, 2013. ,
The Art of Multiprocessor Programming, 2008. ,
Linearizability: a correctness condition for concurrent objects, ACM Trans. Program. Lang. Syst, vol.12, issue.3, pp.463-492, 1990. ,
The SPIN Model Checker -Primer and Reference Manual, 2004. ,
Proving a non-blocking algorithm for process renaming with TLA +, IEC: IEC-61508: Functional safety, vol.11823, pp.147-166, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02442015
Scalable synchronous queues, Commun. ACM, vol.52, issue.5, pp.100-111, 2009. ,
Nonblocking concurrent data structures with condition synchronization, DISC 2004, vol.3274, pp.174-187 ,
, , 2004.
Parameterized model checking of fault-tolerant distributed algorithms by abstraction, Formal Methods in Computer-Aided Design, pp.201-209, 2013. ,
Specifying Systems, 2002. ,
Byzantizing paxos by refinement, DISC 2011, vol.6950, pp.211-224, 2011. ,
Formal verification of the pastry protocol, 2013. ,
URL : https://hal.archives-ouvertes.fr/tel-01750356
Towards verification of the pastry protocol using TLA +, FMOODS/FORTE -2011, vol.6722, pp.244-258, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00593523
Wait-free algorithms for fast, long-lived renaming, Sci. Comput. Program, vol.25, issue.1, pp.1-39, 1995. ,
Using elimination to implement scalable and lock-free FIFO queues, 17th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2005, pp.253-262, 2005. ,
Set-linearizability, Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, p.396, 1994. ,
Verifying linearizability with hindsight, 29th Annual ACM Symposium on Principles of Distributed Computing, PODC, pp.85-94, 2010. ,
Concurrent Programming -Algorithms, Principles, and Foundations, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00922217
Elimination trees and the construction of pools and stacks, Theory Comput. Syst, vol.30, issue.6, pp.645-670, 1997. ,
A compositional proof method for linearizability applied to a wait-free multiset, IFM 2014, vol.8739, pp.357-372, 2014. ,
Using lightweight modeling to understand Chord, SIGCOMM Comput. Commun. Rev, vol.42, issue.2, pp.49-57, 2012. ,