{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:07Z","timestamp":1725664027941},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584681"},{"type":"electronic","value":"9783540489849"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58468-4_162","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:15:55Z","timestamp":1330254955000},"page":"110-127","source":"Crossref","is-referenced-by-count":8,"title":["Efficient reconfiguration of trees: A case study in methodical design of nonmasking fault-tolerant programs"],"prefix":"10.1007","author":[{"given":"Anish","family":"Arora","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"11","key":"6_CR1","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/32.256850","volume":"19","author":"A. Arora","year":"1993","unstructured":"A. Arora and M. G. Gouda, \u201cClosure and convergence: A foundation of faulttolerant computing\u201d. IEEE Trans. on Soft. Engg. 19(11) (1993) 1015\u20131027","journal-title":"IEEE Trans. on Soft. Engg."},{"key":"6_CR2","volume-title":"Ph.D. Dissertation","author":"A. Arora","year":"1992","unstructured":"A. Arora, \u201cA foundation of fault-tolerant computing\u201d. Ph.D. Dissertation, The University of Texas at Austin (1992)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"A. Arora, M. G. Gouda, and G. Varghese, \u201cConstraint satisfaction as a basis for designing nonmasking fault-tolerance\u201d. J. High Speed Networks (1994 to appear); Proc. 14th Intl. Conf. on Distributed Computer Systems (1994) 424\u2013431","DOI":"10.1090\/dimacs\/018\/21"},{"key":"6_CR4","unstructured":"E. W. Dijkstra, A Discipline of Programming, Prentice-Hall (1976)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"D. Gries, The Science of Programming, Springer-Verlag (1981)","DOI":"10.1007\/978-1-4612-5983-1"},{"issue":"1","key":"6_CR6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. G. Gallagher","year":"1983","unstructured":"R. G. Gallagher, P. A. Humblet, and P. M. Spira, \u201cA distributed algorithm for minimum-weight spanning trees\u201d. ACM Trans. on Prog. Lang. and Sys. 5(1) (1983) 66\u201377","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"key":"6_CR7","unstructured":"G. Varghese, \u201cSelf-stablization by local checking and correction\u201d. Ph.D. Dissertation, Massachusetts Institute of Technology (1992)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"A. Arora and M. G. Gouda, \u201cDistributed reset\u201d. IEEE Trans. on Computers (1994 to appear); Proc. 10th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 472, Springer-Verlag (1990) 316\u2013331.","DOI":"10.1007\/3-540-53487-3_54"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques in Real-Time and Fault-Tolerant Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58468-4_162.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:44:30Z","timestamp":1687272270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58468-4_162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584681","9783540489849"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-58468-4_162","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}