{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:24Z","timestamp":1725550524477},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309598"},{"type":"electronic","value":"9783540324287"}],"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\/11603771_4","type":"book-chapter","created":{"date-parts":[[2005,12,12]],"date-time":"2005-12-12T12:11:50Z","timestamp":1134389510000},"page":"32-44","source":"Crossref","is-referenced-by-count":3,"title":["Safe Composition of Distributed Programs Communicating over Order-Preserving Imperfect Channels"],"prefix":"10.1007","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","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/62546.62556","volume-title":"PODC 1988","author":"C.T. Chou","year":"1988","unstructured":"Chou, C.T., Gafni, E.: Understanding and verifying distributed algorithms using stratified decomposition. In: Dolev, D. (ed.) PODC 1988, pp. 44\u201365. ACM Press, New York (1988)"},{"key":"4_CR2","volume-title":"Concurrency Verification","author":"W.-P. Roever de","year":"2001","unstructured":"de Roever, W.-P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"4_CR3","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":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11561927_18","volume-title":"Distributed Computing","author":"K. Engelhardt","year":"2005","unstructured":"Engelhardt, K., Moses, Y.: Causing communication closure: Safe program composition with non-FIFO channels. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 229\u2013243. Springer, Heidelberg (2005)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/11603771_3","volume-title":"Distributed Computing \u2013 IWDC 2005","author":"K. Engelhardt","year":"2005","unstructured":"Engelhardt, K., Moses, Y.: Single-bit messages are insufficient in the presence of duplication. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol.\u00a03741, pp. 25\u201331. Springer, Heidelberg (2005)"},{"key":"4_CR6","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":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/3-540-17179-7_20","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. 330\u2013343. Springer, Heidelberg (1986)"},{"key":"4_CR8","unstructured":"Janssen, W.: Layered Design of Parallel Systems. PhD thesis, University of Twente (1994)"},{"key":"4_CR9","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)"},{"key":"4_CR10","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)"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(88)90023-3","volume":"27","author":"R. Koo","year":"1988","unstructured":"Koo, R., Toueg, S.: Effects of message loss on the termination of distributed protocols. Information Processing Letters\u00a027(4), 181\u2013188 (1988)","journal-title":"Information Processing Letters"},{"key":"4_CR12","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":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/3-540-45022-X_41","volume-title":"Automata, Languages and Programming","author":"B. Meenakshi","year":"2000","unstructured":"Meenakshi, B., Ramanujam, R.: Reasoning about message passing in finite state environments. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 487\u2013498. Springer, Heidelberg (2000)"},{"issue":"3-4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.cl.2004.02.003","volume":"30","author":"B. Meenakshi","year":"2004","unstructured":"Meenakshi, B., Ramanujam, R.: Reasoning about layered message passing systems. Computer Languages, Systems & Structures\u00a030(3-4), 171\u2013206 (2004)","journal-title":"Computer Languages, Systems & Structures"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/164051.164080","volume-title":"PODC 1993","author":"Y. Moses","year":"1993","unstructured":"Moses, Y., Kislev, O.: Knowledge-oriented programming. In: PODC 1993, pp. 261\u2013270. ACM Press, New York (1993)"},{"key":"4_CR16","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":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1986","unstructured":"Pratt, V.R.: Modelling concurrency with partial orders. International Journal of Parallel Programming\u00a015(1), 33\u201371 (1986)","journal-title":"International Journal of Parallel Programming"},{"issue":"6","key":"4_CR18","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"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing \u2013 IWDC 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11603771_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:48:00Z","timestamp":1558273680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11603771_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309598","9783540324287"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11603771_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}