{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:10Z","timestamp":1725455590528},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022453","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"273-288","source":"Crossref","is-referenced-by-count":1,"title":["Using consistent subcuts for detecting stable properties"],"prefix":"10.1007","author":[{"given":"Keith","family":"Marzullo","sequence":"first","affiliation":[]},{"given":"Laura","family":"Sabel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"K. Birman, A. Schiper, and P. Stephenson. Fast causal multicast. Technical Report TR-90-1105, Cornell University, April 1990. Submitted for publication.","DOI":"10.21236\/ADA220910"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"G. Bracha and Sam Toueg. A distributed algorithm for generalized deadlock detection. In Proceedings of the Symposium on Principles of Distributed Computing, pages 285\u2013301. ACM SIGPLAN\/SIGOPS, August 1984.","DOI":"10.1145\/800222.806756"},{"issue":"2","key":"20_CR3","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/357360.357365","volume":"1","author":"K. Mani Chandy","year":"1983","unstructured":"K. Mani Chandy, Laura M. Haas, and Jayadev Misra. Distributed deadlock detection. ACM Transactions on Computer Systems, 1(2):144\u2013156, May 1983.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"1","key":"20_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. Mani Chandy","year":"1985","unstructured":"K. Mani Chandy and Leslie Lamport. Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1):63\u201375, February 1985.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"3","key":"20_CR5","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/5956.5958","volume":"8","author":"K. Mani Chandy","year":"1986","unstructured":"K. Mani Chandy and Jayadev Misra. An example of stepwise refinement of distributed programs: Queiscence detection. ACM Transactions on Programming Languages and Systems, 8(3):326\u2013343, July 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"20_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E. W. Dijkstra","year":"1980","unstructured":"Edsger W. Dijkstra and E. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1\u20134, 1980.","journal-title":"Information Processing Letters"},{"issue":"7","key":"20_CR7","doi-asserted-by":"crossref","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"},{"issue":"3","key":"20_CR8","doi-asserted-by":"crossref","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(3):161\u2013175, 1987.","journal-title":"Distributed Computing"},{"key":"20_CR9","unstructured":"Friedemann Mattern. Time and global states of distributed systems. In Michel Cosnard et. al., editor, Proceedings of the International Workshop on Parallel and Distributed Algorithms, pages 215\u2013226. North-Holland, October 1989."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Jayadev Misra. Detecting termination of distributed computations using markers. In Proceedings of the Symposium on Principles of Distributed Computing, pages 290\u2013294. ACM SIGPLAN\/SIGOPS, August 1983.","DOI":"10.1145\/800221.806729"},{"key":"20_CR11","unstructured":"Larry L. Peterson. Preserving context information in an IPC abstraction. In Proceedings of the 6th Symposium on Reliability in Distributed Software and Database Systems, pages 22\u201331, March 1987."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022453.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:32Z","timestamp":1607550512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0022453","relation":{},"subject":[]}}