{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:48:01Z","timestamp":1770738481673,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540193661","type":"print"},{"value":"9783540392392","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019807","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T00:25:50Z","timestamp":1131841550000},"page":"219-256","source":"Crossref","is-referenced-by-count":10,"title":["A modular proof of correctness for a network synchronizer"],"prefix":"10.1007","author":[{"given":"A.","family":"Fekete","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Shrira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B., \u2018Complexity of Network Synchronization,\u2019 JACM, 32, 4, 804\u2013823 (1985).","journal-title":"JACM"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/net.3230150404","volume":"15","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B., \u2018Reducing Complexities of Distributed Maximum Flow and Breadth-First Search Algorithms by means of Network Synchronization,\u2019 Networks, 15, 425\u2013437 (1985).","journal-title":"Networks"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Fekete, A., Lynch, N., Merritt, M., and Weihl, W., \u2018Nested Transactions and Read\/Write Locking,\u2019 Proceedings of 6th ACM Symposium on Principles of Database Systems, 1987.","DOI":"10.1145\/28659.28669"},{"key":"18_CR4","unstructured":"Goldman, K., and Lynch, N., \u2018Nested Transactions and Quorum Consensus,\u2019 Proceedings of 6th ACM Symposium on Principles of Distributed Computation, 1987."},{"key":"18_CR5","unstructured":"Herlihy, M., Lynch, N., Merritt, M., and Weihl, W., \u2018Correctness of Orphan Elimination Algorithms,\u2019 Proceedings of 17th IEEE Symposium on Fault-Tolerant Computing, 1987."},{"key":"18_CR6","unstructured":"Hailpern, B., and Owicki, S., \u2018Verifying Network Protocols Using Temporal Logic,\u2019 Proceedings of IEEE Conference on Trends and Applications: 1980, Computer Network Protocols."},{"key":"18_CR7","series-title":"Technical Report","volume-title":"Introduction to the Theory of Nested Transactions","author":"N. Lynch","year":"1986","unstructured":"Lynch, N., and Merritt, M., \u2018Introduction to the Theory of Nested Transactions,\u2019 Technical Report MIT\/LCS\/TR-367, MIT Laboratory for Computer Science, Cambridge, MA., July 1986."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Lynch, N., and Tuttle, M., \u2018Hierarchical Correctness Proofs for Distributed Algorithms,\u2019 Proceedings of 6th ACM Symposium on Principles of Distributed Computation, 1987.","DOI":"10.1145\/41840.41852"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Manna, Z., and Pnueli, A., \u2018Verification of Concurrent Programs: the Temporal framework,\u2019 In The Correctness Problem in Computer Science, R. Boyer and J. Moore, eds, Academic Press, 1981.","DOI":"10.21236\/ADA106750"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki, S., and Gries, D., \u2018An Axiomatic Proof Technique for Parallel Programs I,\u2019 Acta Informatica 6, 4, 319\u2013340 (1976).","journal-title":"Acta Informatica"},{"key":"18_CR11","unstructured":"Welch, J., 'synthesis of Efficient Mutual Exclusion Algorithms,\u2019 manuscript"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T05:29:04Z","timestamp":1549258144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0019807","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988]]}}}