{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:07Z","timestamp":1725543427184},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114465"},{"type":"electronic","value":"9783642114472"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11447-2_2","type":"book-chapter","created":{"date-parts":[[2010,1,8]],"date-time":"2010-01-08T14:47:12Z","timestamp":1262962032000},"page":"17-32","source":"Crossref","is-referenced-by-count":1,"title":["Designing Old and New Distributed Algorithms by Replaying an Incremental Proof-Based Development"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Cansell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"M\u00e9ry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624162","volume-title":"The B book - Assigning Programs to Meanings","author":"J.-R. Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B book - Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10930755_1","volume-title":"Theorem Proving in Higher Order Logics","author":"J.-R. Abrial","year":"2003","unstructured":"Abrial, J.-R., Cansell, D.: Click\u2019n prove: Interactive proofs within set theory. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 1\u201324. Springer, Heidelberg (2003)"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s001650300002","volume":"14","author":"J.-R. Abrial","year":"2003","unstructured":"Abrial, J.-R., Cansell, D., M\u00e9ry, D.: A Mechanically Proved and Incremental Development of IEEE 1394 Tree Identify Protocol. Formal Aspects of Computing\u00a014(3), 215\u2013227 (2003)","journal-title":"Formal Aspects of Computing"},{"doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on theory of computing, pp. 82\u201393 (1980)","key":"2_CR4","DOI":"10.1145\/800141.804655"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(81)90005-2","volume":"23","author":"R. Back","year":"1979","unstructured":"Back, R.: On correct refinement of programs. Journal of Computer and System Sciences\u00a023(1), 49\u201368 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR6","series-title":"EATCS Textbook in Computer Science","volume-title":"Logics of Specification Languages","year":"2007","unstructured":"Bj\u00f8rner, D., Henson, M.C. (eds.): Logics of Specification Languages. EATCS Textbook in Computer Science. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on principles of distributed computing, pp. 181\u2013188 (1999)","key":"2_CR7","DOI":"10.1145\/301308.301355"},{"doi-asserted-by":"crossref","unstructured":"Cansell, D., M\u00e9ry, D.: Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm. Theoretical Computer Science (2006)","key":"2_CR8","DOI":"10.1016\/j.tcs.2006.08.015"},{"key":"2_CR9","first-page":"33","volume-title":"The event-B Modelling Method: Concepts and Case Studies","author":"D. Cansell","year":"2007","unstructured":"Cansell, D., M\u00e9ry, D.: The event-B Modelling Method: Concepts and Case Studies, pp. 33\u2013140. Springer, Heidelberg (2007); See [6]"},{"key":"2_CR10","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"T. Kameda","year":"1996","unstructured":"Kameda, T., Yamashita, M.: Computing on anonymous networks: Part i - characterizing the solvable cases. IEEE Transactions on parallel and distributed systems\u00a07(1), 69\u201389 (1996)","journal-title":"IEEE Transactions on parallel and distributed systems"},{"key":"2_CR12","volume-title":"Specifying Systems: The TLA\u2009+\u2009 Language and Tools for Hardware and Software Engineers","author":"L. Lamport","year":"2002","unstructured":"Lamport, L.: Specifying Systems: The TLA\u2009+\u2009 Language and Tools for Hardware and Software Engineers. Addison-Wesley, Reading (2002)"},{"key":"2_CR13","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco (1996)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/PL00013315","volume":"37","author":"L. Moreau","year":"2001","unstructured":"Moreau, L., Duprat, J.: A Construction of Distributed Reference Counting. Acta Informatica\u00a037, 563\u2013595 (2001)","journal-title":"Acta Informatica"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/B978-1-4832-3187-7.50019-2","volume-title":"Graph theory and computing","author":"P. Rosenstiehl","year":"1972","unstructured":"Rosenstiehl, P., Fiksel, J.-R., Holliger, A.: Intelligent graphs. In: Read, R. (ed.) Graph theory and computing, pp. 219\u2013265. Academic Press, New York (1972)"}],"container-title":["Lecture Notes in Computer Science","Rigorous Methods for Software Construction and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11447-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:44Z","timestamp":1606185644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11447-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642114465","9783642114472"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11447-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}