{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:19Z","timestamp":1725664999585},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617693"},{"type":"electronic","value":"9783540706793"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61769-8_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:21:56Z","timestamp":1330276916000},"page":"89-104","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Abstracting communication to reason about distributed algorithms"],"prefix":"10.1007","author":[{"given":"Michel","family":"Charpentier","sequence":"first","affiliation":[]},{"given":"Mamoun","family":"Filali","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Mauran","sequence":"additional","affiliation":[]},{"given":"G\u00e9rard","family":"Padiou","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Qu\u00e9innec","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/356901.356903","volume":"15","author":"G. R. Andrews","year":"1983","unstructured":"Gregory R. Andrews and Fred B. Schneider. Concepts and notations for concurrent programming. Computing Surveys, 15(1):3\u201343, March 1983.","journal-title":"Computing Surveys"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"7_CR3","unstructured":"M. Charpentier, M. Filali, P. Mauran, G. Padiou, and P. Qu\u00e9innec. R\u00e9partition par observation dans Unity. Technical Report 96-01-R, IRIT, 27 pages, January 1996."},{"key":"7_CR4","unstructured":"Michel Charpentier. Une s\u00e9mantique pour Unity avec section observe. Technical report, IRIT, April 1996."},{"key":"7_CR5","unstructured":"Michel Charpentier, Abdellah El Hadri, and G\u00e9rard Padiou. A Unity-based algorithm design assistant. In Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 131\u2013145, Aarhus, Denmark, May 1995. BRICS Notes Series NS-95-2."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Vilay K. Garg. Principles of Distributed Systems. Kluwer Academic Publisher, 1996.","DOI":"10.1007\/978-1-4613-1321-2"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Rob Gerth and Amir Pnueli. Rooting UNITY. In Proc. fifth Int. Workshop on Software Specification and Design, pages 11\u201319, May 1989.","DOI":"10.1145\/75200.75202"},{"key":"7_CR8","volume-title":"PhD thesis","author":"D. M. Goldschlag","year":"1992","unstructured":"David Moshe Goldschlag. Mechanically Verifiyng Concurrent Programs. PhD thesis, University of Texas at Austin, May 1992."},{"key":"7_CR9","unstructured":"M.J.C. Gordon and T.F. Melham. Introduction to HOL: A Theorem Proving Environnement for Higher Order Logic. Cambridge University Press, 1993."},{"key":"7_CR10","unstructured":"C. A. R. Hoare. Coomunicating Sequential Processes. Prentice-Hall International, 1984."},{"issue":"7","key":"7_CR11","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Leslie Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7):558\u2013565, July 1978.","journal-title":"Communications of the ACM"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01782776","volume":"2","author":"F. Mattern","year":"1987","unstructured":"Friedemann Mattern. Algorithms for distributed termination detection. Distributed Computing, 2:161\u2013175, 1987.","journal-title":"Distributed Computing"},{"key":"7_CR14","volume-title":"Technical report","author":"J. Misra","year":"1994","unstructured":"Jayadev Misra. A logic for concurrent programming. Technical report, The University of Texas at Austin, April 1994."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"G. Ricart and A.K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1):9\u201317, January 1981.","journal-title":"Communications of the ACM"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01898402","volume":"3","author":"B. A. Sanders","year":"1991","unstructured":"Beverly A. Sanders. Eliminating the substitution axiom from Unity logic. Formal Aspects of Computing, 3(2):189\u2013205, 1991.","journal-title":"Formal Aspects of Computing"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"R.T. Udink and J.N. Kok. On the relation between Unity properties and sequence of states. In J.W de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Semantics: Foundations and Applications, volume 666 of Lecture Notes in Computer Science, pages 594\u2013608, 1993.","DOI":"10.1007\/3-540-56596-5_48"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61769-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:41:57Z","timestamp":1558255317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61769-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617693","9783540706793"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61769-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}