{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:25:42Z","timestamp":1649085942475},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T00:00:00Z","timestamp":1240531200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00446-009-0081-9","type":"journal-article","created":{"date-parts":[[2009,4,23]],"date-time":"2009-04-23T20:56:52Z","timestamp":1240520212000},"page":"73-91","source":"Crossref","is-referenced-by-count":0,"title":["Causing communication closure: safe program composition with reliable non-FIFO channels"],"prefix":"10.1007","volume":"22","author":[{"given":"Kai","family":"Engelhardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoram","family":"Moses","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,24]]},"reference":[{"issue":"6","key":"81_CR1","doi-asserted-by":"crossref","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.A., Mansour Y., Wang D.-W., Zuck L.: Reliable communication over unreliable channels. J. ACM 41(6), 1267\u20131297 (1994)","journal-title":"J. ACM"},{"issue":"4","key":"81_CR2","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch B.: Complexity of network synchronization. J. ACM 32(4), 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"81_CR3","volume-title":"Principles of Concurrent and Distributed Programming","author":"M. Ben-Ari","year":"2006","unstructured":"Ben-Ari M.: Principles of Concurrent and Distributed Programming, 2nd edn. Addison-Wesley, Boston (2006)","edition":"2"},{"issue":"2","key":"81_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/356586.356588","volume":"3","author":"E.G. Coffman Jr","year":"1971","unstructured":"Coffman E.G. Jr, Elphick M.J., Shoshani A.: System deadlocks. ACM Comput. Surv. 3(2), 67\u201378 (1971)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"81_CR5","doi-asserted-by":"crossref","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. Sci. Comput. Program. 2(3), 155\u2013173 (1982)","journal-title":"Sci. Comput. Program."},{"key":"81_CR6","doi-asserted-by":"crossref","unstructured":"Engelhardt, K., Moses, Y.: Causing communication closure: Safe program composition with non-FIFO channels. In: Fraigniaud, P. (ed.) DISC 2005 19th International Symposium on Distributed Computing, volume 3724 of LNCS, pp. 229\u2013243. Springer, 26\u201329 September (2005)","DOI":"10.1007\/11561927_18"},{"key":"81_CR7","doi-asserted-by":"crossref","unstructured":"Engelhardt, K., Moses, Y.: Safe composition of distributed programs communicating over order-preserving imperfect channels. In: Pal, A., Kshemkalyani, A., Kumar, R., Gupta, A. (eds.) 7th International Workshop on Distributed Computing IWDC 2005, volume 3741 of LNCS, pp. 32\u201344. Springer, 27\u201330 December (2005)","DOI":"10.1007\/11603771_4"},{"key":"81_CR8","doi-asserted-by":"crossref","unstructured":"Fokkinga, M., Poel, M., Zwiers, J.: Modular completeness for communication closed layers. In: Best, E. (ed.) CONCUR \u201993: 4th International Conference on Concurrency Theory, volume 715 of LNCS, pp. 50\u201365. Springer, Germany, Hildesheim, 23\u201326 August (1993)","DOI":"10.1007\/3-540-57208-2_5"},{"key":"81_CR9","doi-asserted-by":"crossref","unstructured":"Gerth, R., Shrira, L.: On proving communication closedness of distributed layers. In: Nori, K.V. (ed.) Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, volume 241 of LNCS, pp. 330\u2013343, Springer, New Delhi, India, 18\u201320 December (1986)","DOI":"10.1007\/3-540-17179-7_20"},{"key":"81_CR10","doi-asserted-by":"crossref","unstructured":"Janssen, W.: Layers as knowledge transitions in the design of distributed systems. In: Engberg, U.H., Larsen, K.G., Skou, A. (eds.) Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS (Aarhus, Denmark, 19\u201320 May, 1995), number NS-95-2 in Notes Series, pp. 304\u2013318, Department of Computer Science, University of Aarhus, May 1995. BRICS","DOI":"10.1007\/3-540-60630-0_12"},{"key":"81_CR11","doi-asserted-by":"crossref","unstructured":"Janssen, W., Poel, M., Zwiers, J.: Action systems and action refinement in the development of parallel systems. In: Baeten J.C.M., Groote, J.F. (eds.) Proceedings of CONCUR \u201991, 2nd International Conference on Concurrency Theory, volume 527 of LNCS, pp. 298\u2013316, Amsterdam, The Netherlands (1991)","DOI":"10.1007\/3-540-54430-5_96"},{"key":"81_CR12","doi-asserted-by":"crossref","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 (1992)","DOI":"10.1145\/135419.135461"},{"key":"81_CR13","doi-asserted-by":"crossref","unstructured":"Janssen, W., Zwiers, J.: Protocol design by layered decomposition: A compositional approach. In: Vytopil, J. (ed.) Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 571 of LNCS, pp. 307\u2013326. Springer (1992)","DOI":"10.1007\/3-540-55092-5_17"},{"key":"81_CR14","unstructured":"Janssen, W., Zwiers, J.: Specifiying and proving communication closedness in protocols. In: Danthine, A.A.S., Leduc, G., Wolper, P. (eds.) PSTV, volume C-16 of IFIP Transactions, pp. 323\u2013339. North-Holland (1993)"},{"key":"81_CR15","doi-asserted-by":"crossref","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. Commun. ACM 7, 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"key":"81_CR16","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch N.A.: Distributed Algorithms. Morgan Kaufmann, San Mateo (1996)"},{"key":"81_CR17","doi-asserted-by":"crossref","unstructured":"Poel, M., Zwiers, J.: Layering techniques for development of parallel systems. In: von Bochmann, G., Probst, D.K. (eds.) Computer Aided Verification, Fourth International Workshop, CAV \u201992, volume 663 of LNCS, pp. 16\u201329. Springer, Montreal, Canada, 29 June\u20131 July (1992)","DOI":"10.1007\/3-540-56496-9_3"},{"key":"81_CR18","unstructured":"Stomp, F., de Roever, W.-P.: A correctness proof of a minimum-weight spanning tree algorithm (extended abstract). In: Popescu-Zeletin, R., Le Lann, G., Kim, K. (eds.) Proceedings of the 7th International Conference on Distributed Computing Systems, pp. 440\u2013447. Computer Society Press of the IEEE (1987)"},{"key":"81_CR19","doi-asserted-by":"crossref","unstructured":"Stomp, F.A., de Roever, W.P.: Designing distributed algorithms by means of formal sequentially phased reasoning (extended abstract). In: Bermond J.-C., Raynal, M. (eds.) Distributed Algorithms, 3rd International Workshop, Nice, France, 26\u201328 September 1989, Proceedings, volume 392 of LNCS, pp. 242\u2013253. Springer (1989)","DOI":"10.1007\/3-540-51687-5_47"},{"issue":"6","key":"81_CR20","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 Asp. Comput. 6(6), 716\u2013737 (1994)","journal-title":"Formal Asp. Comput."},{"key":"81_CR21","doi-asserted-by":"crossref","unstructured":"Wang, D.-W., Zuck, L.D.: Tight bounds for the sequence transmission problem. In: PODC \u201989: Proceedings of the eighth annual ACM Symposium on Principles of Distributed Computing, pp. 73\u201383. ACM Press (1989)","DOI":"10.1145\/72981.72986"},{"key":"81_CR22","doi-asserted-by":"crossref","unstructured":"Zwiers, J.: Layering and action refinement for timed systems. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) Real-Time: Theory in Practice, REX Workshop, volume 600 of LNCS, pp. 687\u2013723. Springer (1991)","DOI":"10.1007\/BFb0032013"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0081-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-009-0081-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0081-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T18:15:53Z","timestamp":1589739353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-009-0081-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,24]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["81"],"URL":"https:\/\/doi.org\/10.1007\/s00446-009-0081-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,24]]}}}