{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:45:50Z","timestamp":1648734350214},"reference-count":24,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1997]]},"DOI":"10.1051\/ita\/1997310200971","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:16:17Z","timestamp":1486048577000},"page":"97-148","source":"Crossref","is-referenced-by-count":0,"title":["Introduction \u00e0 l'algorithmique des objets partag\u00e9s"],"prefix":"10.1051","volume":"31","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Cori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"[Abr] ABRAHAM U., On interprocess communication and the problem of common atomic registers, Technical Report Ben-gurion University, Israel, 1988."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"[And] ANDERSON J. H., Composite registers, Distributed Computing, 1993, 6, pp. 141-154.0781.68042","DOI":"10.1007\/BF02242703"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"[Ang] ANGER F. D., On Lamport's Interprocessor Communication Model, ACM Trans. on Programming Languages and Systems, 1989, 11, pp. 404-417.","DOI":"10.1145\/65979.65982"},{"key":"R4","unstructured":"[Arn ] ARNOLD A., An example of use of MEC: verification of Tromp's algorithm, Technical Report, Universit\u00e9 Bordeaux 1, 1993."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"[AKKV] AWERBUCH B., KIROUSIS L. M., KRANAKIS E.et VIT\u00c1NYI P., 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.10239030669.68019","DOI":"10.1007\/3-540-50517-2_87"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"[Blo] BLOOM B., Constructing Two-writer atomic register, IEEE Trans. on Computers, 1988, 37, pp. 1506-1514.9754010663.68034","DOI":"10.1109\/12.9729"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"[HS] HALDAR S.et SUBRAMANIAN P. S., 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.1325246","DOI":"10.1007\/BFb0020428"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"[Her] HERLIHY M., Wait free synchronization, ACM Trans. on Programming Languages and Systems, 1991, 13, pp. 124-149.","DOI":"10.1145\/114005.102808"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"[HW] HERLIHY M.et WING M., Linearizability : a correctness condition for concurrent objects, ACM Trans. on Programming Languages and Systems, 1990, 12, pp. 463-492.","DOI":"10.1145\/78969.78972"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"[IS] ISRAELI A. et SHAHAM A., Optimal multi-writer atomic register, Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, 1992.1082.68017","DOI":"10.1145\/135419.135435"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"[KKV] KIROUSIS L. M., KRANAKIS E.et VIT\u00c1NYI P., Atomic Mulitreader Register, International 2nd Workshop on Distributed Computing, LNCS, Springer Verlag 1987, 312, pp. 278-296.","DOI":"10.1007\/BFb0019809"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"[KV] KIROUSIS L. M. et VENERIS A. G., 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.12844890925.68169","DOI":"10.1007\/3-540-57271-6_27"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"[L78] LAMPORT L., Time, Clocks, and the Orderings of Events in a Distributed System, Communications of the ACM, 1978, 21, pp. 558-564.0378.68027","DOI":"10.1145\/359545.359563"},{"key":"R14","unstructured":"[L85] LAMPORT L., Interprocess communication, SRI Technical Report, March 1985."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"[L86a] LAMPORT L., On interprocess communication: Part I-Basic formalism, Distributed Computing, 1986, 1, pp. 77-85.0598.68022","DOI":"10.1007\/BF01786227"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"[L86b] LAMPORT L., On interprocess communication: Part II-Algorithms, Distributed Computing, 1986, 1, pp. 86-101.0598.68023","DOI":"10.1007\/BF01786228"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"[Mis] MISRA J., Axioms for memory access in asynchronous hardware systems, ACM Trans. on Programming Languages and Systems, 1986, 8, pp. 142-153.8222690593.68017","DOI":"10.1145\/5001.5007"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"[Mor] M\u00d6RING R. H., Algorithmic aspects of comparability graphs and interval graphs in Graphs and Order(NATO ASI C147), L Rival ed D. Reidel, 1985, pp. 41-101.8184930569.05046","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"[Ore] ORE O., Theory of Graphs, Amer. Math. Soc. Colloq. Publ., Providence, 1962, 38.1507530105.35401","DOI":"10.1090\/coll\/038"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"[Pet] PETERSON G. L., Concurrent reading while writing, ACM Trans. on Programming Languages and Systems, 1983, 5, pp. 46-55.0498.68010","DOI":"10.1145\/357195.357198"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"[Tro] TROMP J., How to Construct an Atomic Variable, International Workshop on Distributed Algorithms, LNCS, Springer Verlag 1989, 392, pp. 292-302.","DOI":"10.1007\/3-540-51687-5_51"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"[Vid] VIDYASANKAR K., Converting Lamport's regular register to atomic register, Information Processing Letters, 1988, 28, pp. 287-290.9635150662.68049","DOI":"10.1016\/0020-0190(88)90175-5"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"[VA] VIT\u00c1NYI P. et AWERBUCH B., Atomic shared acces by asynchronous hardware, Proceedings of the 27th Symposium on Foundations of Computer Science, 1986, Errata, Ibid, 1987.","DOI":"10.1109\/SFCS.1986.11"},{"key":"R24","unstructured":"[Wie] WIENER N., A contribution to the theory of relative position, Proc. Camb. Philos. Soc., 1914, 17, pp. 441-449.45.1150.1045.1150.10"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1997310200971\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T06:01:13Z","timestamp":1568786473000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1997310200971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":24,"journal-issue":{"issue":"2"},"alternative-id":["ita1997310200971"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1997310200971","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}