{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:32Z","timestamp":1725569972576},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_18","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"229-243","source":"Crossref","is-referenced-by-count":2,"title":["Causing Communication Closure: Safe Program Composition with Non-FIFO Channels"],"prefix":"10.1007","author":[{"given":"Kai","family":"Engelhardt","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Moses","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1145\/195613.195651","volume":"41","author":"Y. Afek","year":"1994","unstructured":"Afek, Y., Attiya, H., Fekete, A., Fischer, M., Lynch, N., Mansour, Y., Wang, D.-W., Zuck, L.: Reliable communication over unreliable channels. Journal of the ACM\u00a041(6), 1267\u20131297 (1994)","journal-title":"Journal of the ACM"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T. Elrad","year":"1982","unstructured":"Elrad, T., Francez, N.: Decomposition of distributed programs into communication-closed layers. Science of Computer Programming\u00a02(3), 155\u2013173 (1982)","journal-title":"Science of Computer Programming"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Engelhardt, K., Moses, Y.: Safe composition of distributed programs communicating over order-preserving imperfect channels (June 2005) (submitted), see \n                    \n                      ftp:\/\/ftp.cse.unsw.edu.au\/pub\/users\/kaie\/EM2005b.pdf","DOI":"10.1007\/11603771_4"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Engelhardt, K., Moses, Y.: Single-bit messages are insufficient in the presence of duplication (June 2005) (in preparation), see \n                    \n                      ftp:\/\/ftp.cse.unsw.edu.au\/pub\/users\/kaie\/EM2005c.pdf","DOI":"10.1007\/11603771_3"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BFb0039061","volume-title":"CONCUR \u201990","author":"A. Fekete","year":"1990","unstructured":"Fekete, A., Lynch, N.: The need for headers: An impossibility result for communication over unreliable channels. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 199\u2013215. Springer, Heidelberg (1990)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","first-page":"18","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R. Gerth","year":"1986","unstructured":"Gerth, R., Shrira, L.: On proving communication closedness of distributed layers. In: Nori, K.V. (ed.) FSTTCS 1986. LNCS, vol.\u00a0241, pp. 18\u201320. Springer, Heidelberg (1986)"},{"key":"18_CR7","unstructured":"Janssen, W.: Layered Design of Parallel Systems. PhD thesis, University of Twente (1994)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","first-page":"304","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"W. Janssen","year":"1995","unstructured":"Janssen, W.: Layers as knowledge transitions in the design of distributed systems. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019, pp. 304\u2013318. Springer, Heidelberg (1995) number NS-95-2 in Notes Series, pp.\u00a0304\u2013318, Department of Computer Science, University of Aarhus (May 1995) BRICS"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-54430-5_96","volume-title":"CONCUR \u201991","author":"W. Janssen","year":"1991","unstructured":"Janssen, W., Poel, M., Zwiers, J.: Action systems and action refinement in the development of parallel systems. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 298\u2013316. Springer, Heidelberg (1991)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/135419.135461","volume-title":"Proceedings 11th ACM Symposium on Principles of Distributed Computing","author":"W. Janssen","year":"1992","unstructured":"Janssen, W., Zwiers, J.: From sequential layers to distributed processes, deriving a minimum weight spanning tree algorithm (extended abstract). In: Proceedings 11th ACM Symposium on Principles of Distributed Computing, pp. 215\u2013227. ACM, New York (1992)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"7","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM\u00a07, 558\u2013565 (1978)","journal-title":"Communications of the ACM"},{"key":"18_CR12","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-56496-9_3","volume-title":"Computer Aided Verification","author":"M. Poel","year":"1993","unstructured":"Poel, M., Zwiers, J.: Layering techniques for development of parallel systems. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 16\u201329. Springer, Heidelberg (1993)"},{"issue":"6","key":"18_CR14","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1007\/BF03259394","volume":"6","author":"F.A. Stomp","year":"1994","unstructured":"Stomp, F.A., de Roever, W.-P.: A principle for sequential reasoning about distributed algorithms. Formal Aspects of Computing\u00a06(6), 716\u2013737 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/72981.72986","volume-title":"PODC 1989: Proceedings of the eighth annual ACM Symposium on Principles of Distributed Computing","author":"D.-W. Wang","year":"1989","unstructured":"Wang, D.-W., Zuck, L.D.: Tight bounds for the sequence transmission problem. In: PODC 1989: Proceedings of the eighth annual ACM Symposium on Principles of Distributed Computing, pp. 73\u201383. ACM Press, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:09:49Z","timestamp":1558307389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11561927_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}