{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:47Z","timestamp":1725664007062},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584506"},{"type":"electronic","value":"9783540488033"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58450-1_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:11:43Z","timestamp":1330272703000},"page":"362-377","source":"Crossref","is-referenced-by-count":1,"title":["Towards a mechanically supported and compositional calculus to design distributed algorithms"],"prefix":"10.1007","author":[{"given":"I. S. W. B.","family":"Prasetya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"A. Arora and M.G. Gouda. Distributed reset. In Proceedings of the 10th Conference on Foundation of Software Technology and Theoretical Computer Science, 1990. Also in Lecture Notes on Computer Science vol. 472.","DOI":"10.1007\/3-540-53487-3_54"},{"key":"24_CR2","unstructured":"A. Arora and M.G. Gouda. Closure and convergence: A foundation for fault-tolerant computing. In Proceedings of the 22nd International Conference on Fault-Tolerant Computing Systems, 1992."},{"key":"24_CR3","unstructured":"Flemming Andersen. A Theorem Prover for UNITY in Higher Order Logic. PhD thesis, Technical University of Denmark, 1992."},{"key":"24_CR4","unstructured":"K.M. Chandy and J. Misra. Parallel Program Design \u2014 A Foundation. Addison-Wesley Publishing Company, Inc., 1988."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"F.S. de Boer and M. van Hulst. A proof system for asynchronously communicating deterministic processes, 1994. Submitted to a conference.","DOI":"10.1007\/3-540-58338-6_72"},{"key":"24_CR6","volume-title":"PhD thesis","author":"T. Herman","year":"1991","unstructured":"Ted Herman. Adaptivity through Distributed Convergence. PhD thesis, University of Texas at Austin, 1991."},{"key":"24_CR7","unstructured":"P.J.A. Lentfert. Distributed Hierarchical Algorithms. PhD thesis, Utrecht University, April 1993."},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02311231","volume":"5","author":"P.K. Pandya","year":"1991","unstructured":"P.K. Pandya and Mathai Joseph. P-a logic-a compositional proof system for distributed programs. Distributed Computing, (5):37\u201354, 1991.","journal-title":"Distributed Computing"},{"key":"24_CR9","unstructured":"I.S.W.B. Prasetya. Formalization of variables access constraints to support compositionality of liveness properties. In Proceeding HUG 93, HOL User's Group Workshop, pages 326\u2013339. University of British Columbia, 1993."},{"key":"24_CR10","unstructured":"I.S.W.B. Prasetya. UU_UNITY: a Mechanical Proving Environment for UNITY Logic. University of Utrecht, 1993. Draft. Available at request."},{"issue":"2","key":"24_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01898402","volume":"3","author":"B.A. Sanders","year":"1991","unstructured":"B.A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2):189\u2013205, 1991.","journal-title":"Formal Aspects of Computing"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Marco Schneider. Self-stabilization. ACM Computing Surveys, 25(1), March 1993.","DOI":"10.1145\/151254.151256"},{"key":"24_CR13","unstructured":"A.K. Singh. Leads-to and program union. Notes on UNITY, 06\u201389, 1989."},{"key":"24_CR14","unstructured":"R. Udink, T. Herman, and J. Kok. Compositional local progress in unity. to appear in the proceeding of IFIP Working Conference on Programming Concepts, Methods and Calculi, 1994., 1994."}],"container-title":["Lecture Notes in Computer Science","Higher Order Logic Theorem Proving and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58450-1_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:31Z","timestamp":1605648091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58450-1_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584506","9783540488033"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58450-1_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}