no. 2
Introduction à l'algorithmique des objets partagés
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 2, pp. 97-148. 
@article{ITA_1997__31_2_97_0,
     author = {Charron-Bost, Bernadette and Cori, Robert and Petit, Antoine},
     title = {Introduction \`a l'algorithmique des objets partag\'es},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {97--148},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {2},
     year = {1997},
     mrnumber = {1462583},
     zbl = {0878.68067},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1997__31_2_97_0/}
}
TY  - JOUR
AU  - Charron-Bost, Bernadette
AU  - Cori, Robert
AU  - Petit, Antoine
TI  - Introduction à l'algorithmique des objets partagés
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1997
SP  - 97
EP  - 148
VL  - 31
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1997__31_2_97_0/
LA  - fr
ID  - ITA_1997__31_2_97_0
ER  - 
%0 Journal Article
%A Charron-Bost, Bernadette
%A Cori, Robert
%A Petit, Antoine
%T Introduction à l'algorithmique des objets partagés
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1997
%P 97-148
%V 31
%N 2
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1997__31_2_97_0/
%G fr
%F ITA_1997__31_2_97_0
Charron-Bost, Bernadette; Cori, Robert; Petit, Antoine. Introduction à l'algorithmique des objets partagés. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 2, pp. 97-148. http://www.numdam.org/item/ITA_1997__31_2_97_0/

[Abr] U. Abraham, On interprocess communication and the problem of common atomic registers, Technical Report Ben-gurion University, Israel, 1988.

[And] J. H. Anderson, Composite registers, Distributed Computing, 1993, 6, pp. 141-154. | Zbl

[Ang] F. D. Anger, On Lamport's Interprocessor Communication Model, ACM Trans. on Programming Languages and Systems, 1989, 11, pp. 404-417.

[Arn ] A. Arnold, An example of use of MEC: verification of Tromp's algorithm, Technical Report, Université Bordeaux 1, 1993.

[AKKV] B. Awerbuch, L. M. Kirousis, E. Kranakiset P. Vitányi, A proof technique for register atomicity, Proceedings of Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS, Springer Verlag, 1988, 338, pp. 286-303. | MR | Zbl

[Blo] B. Bloom, Constructing Two-writer atomic register, IEEE Trans. on Computers, 1988, 37, pp. 1506-1514. | MR | Zbl

[HS] S. Haldaret P. S. Subramanian, Space-optimal conflict free construction of 1-writer 1-reader multivalued atomic register, International 8th Workshop on Distrubuted Computing, LNCS, Springer Verlag, 1994, 857, pp. 116-129. | MR

[Her] M. Herlihy, Wait free synchronization, ACM Trans. on Programming Languages and Systems, 1991, 13, pp. 124-149.

[HW] M. Herlihyet M. Wing, Linearizability : a correctness condition for concurrent objects, ACM Trans. on Programming Languages and Systems, 1990, 12, pp. 463-492.

[IS] A. Israeli et A. Shaham, Optimal multi-writer atomic register, Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, 1992.

[KKV] L. M. Kirousis, E. Kranakiset P. Vitányi, Atomic Mulitreader Register, International 2nd Workshop on Distributed Computing, LNCS, Springer Verlag 1987, 312, pp. 278-296.

[KV] L. M. Kirousis et A. G. Veneris, Efficient algorithms for checking atomicity of a run of read and write operations, International 7th Workshop on Distributed Computing, LNCS, Springer Verlag 1993, 725, pp. 54-68. | MR | Zbl

[L78] L. Lamport, Time, Clocks, and the Orderings of Events in a Distributed System, Communications of the ACM, 1978, 21, pp. 558-564. | Zbl

[L85] L. Lamport, Interprocess communication, SRI Technical Report, March 1985.

[L86a] L. Lamport, On interprocess communication: Part I-Basic formalism, Distributed Computing, 1986, 1, pp. 77-85. | Zbl

[L86b] L. Lamport, On interprocess communication: Part II-Algorithms, Distributed Computing, 1986, 1, pp. 86-101. | Zbl

[Mis] J. Misra, Axioms for memory access in asynchronous hardware systems, ACM Trans. on Programming Languages and Systems, 1986, 8, pp. 142-153. | MR | Zbl

[Mor] R. H. Möring, Algorithmic aspects of comparability graphs and interval graphs in Graphs and Order(NATO ASI C147), L Rival ed D. Reidel, 1985, pp. 41-101. | MR | Zbl

[Ore] O. Ore, Theory of Graphs, Amer. Math. Soc. Colloq. Publ., Providence, 1962, 38. | MR | Zbl

[Pet] G. L. Peterson, Concurrent reading while writing, ACM Trans. on Programming Languages and Systems, 1983, 5, pp. 46-55. | Zbl

[Tro] J. Tromp, How to Construct an Atomic Variable, International Workshop on Distributed Algorithms, LNCS, Springer Verlag 1989, 392, pp. 292-302.

[Vid] K. Vidyasankar, Converting Lamport's regular register to atomic register, Information Processing Letters, 1988, 28, pp. 287-290. | MR | Zbl

[VA] P. Vitányi et B. Awerbuch, Atomic shared acces by asynchronous hardware, Proceedings of the 27th Symposium on Foundations of Computer Science, 1986, Errata, Ibid, 1987.

[Wie] N. Wiener, A contribution to the theory of relative position, Proc. Camb. Philos. Soc., 1914, 17, pp. 441-449. | JFM