{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:52:25Z","timestamp":1694623945049},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1993,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The design and verification of distributed and concurrent algorithms is highly complex, and thus error-prone. It is our experience that the intertwined use of an informal description as well as a formal method in designing and studying an algorithm, is a fruitful one. The advantage of the informal description is the ease with which algorithms can be produced, studied and discussed. In contrast with formal methods however, errors are easily made in informal arguments about programs that seem to be correct, but in fact are not.<\/jats:p>\n          <jats:p>In this paper we use an informal argument, carefully augmented with the use of the UNITY formalism, in the design of a distributed algorithm for maintaining the maximum value of a bag of frequently changing integers on a hierarchically divided network. The resulting algorithm is obtained by first designing an abstract algorithm on a virtual datastructure. Next, the abstract algorithm is transformed into the distributed algorithm.<\/jats:p>","DOI":"10.1007\/bf01211315","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T13:29:29Z","timestamp":1109338169000},"page":"21-60","source":"Crossref","is-referenced-by-count":1,"title":["Distributed maximum maintenance on hierarchically divided graphs"],"prefix":"10.1145","volume":"5","author":[{"given":"P. J. A.","family":"Lentfert","sequence":"first","affiliation":[{"name":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. D.","family":"Swierstra","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","unstructured":"Chandy K.M. and Misra J.: Parallel Program Design \u2014 A Foundation . Addison-Wesley Publishing Company Inc. 1988."},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/78942.78945"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"crossref","unstructured":"Lentfert P.J.A. Uittenbogaard A.H. Swierstra S.D. and Tel G.: Distributed hierarchical routing. Technical Report RUU-CS-89-5 Utrecht University March 1989. Also in: P.M.G. Apers et al. (Eds.). Proceedings CSN89 . Utrecht November 9\u201310 1989.","DOI":"10.1177\/026765838900500105"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-51305-1_6","volume-title":"Proceedings of the Conference on the Mathematics of Program Construction, Groningen","author":"Misra J.","year":"1989"},{"key":"e_1_2_1_2_5_2","first-page":"395","article-title":"Fault-tolerant broadcast of routing information","volume":"7","author":"Perlman R.","year":"1983","journal-title":"Computer Networks"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01898402"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.9730"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211315.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211315\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01211315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:22:30Z","timestamp":1641482550000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01211315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["10.1007\/BF01211315"],"URL":"https:\/\/doi.org\/10.1007\/bf01211315","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}