{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:07:07Z","timestamp":1725494827182},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665885"},{"type":"electronic","value":"9783540481188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48118-4_41","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T01:30:57Z","timestamp":1195003857000},"page":"1720-1737","source":"Crossref","is-referenced-by-count":2,"title":["A termination detection algorithm: specification and verification"],"prefix":"10.1007","author":[{"given":"Robert","family":"Eschbach","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,9,17]]},"reference":[{"issue":"2","key":"41_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"Mart\u00ecn Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253\u2013284, May 1991.","journal-title":"Theoretical Computer Science"},{"key":"41_CR2","unstructured":"Egon B\u00f6rger, Yuri Gurevich, and Dean Rosenzweig. The bakery algorithm: Yet another specification and verification. In E. Bx00F6;rger, editor, Specification and Validation Methods, pages 231\u2013243. Oxford University Press, 1995."},{"key":"41_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Current Trends in Applied Formal Methods (FM-Trends 98)","author":"E. B\u00f6rger","year":"1999","unstructured":"Egon B\u00f6rger. High level system design and analysis using abstract state machines. In Hutter, Stephan, Traverso, and Ullman, editors, Current Trends in Applied Formal Methods (FM-Trends 98), LNCS. Springer, 1999. to appear."},{"issue":"5","key":"41_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E. W. Dijkstra","year":"1983","unstructured":"Edsger W. Dijkstra, W.H.J. Feijen, and A.J.M. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, 16(5):217\u2013219, 1983.","journal-title":"Information Processing Letters"},{"key":"41_CR5","unstructured":"Edsger W. Dijkstra. Shmuel Safra\u2019s version of termination detection. In M. Broy and R. Steinbr\u00fcggen, editors, Proceedings of the NATO Advanced Study Institute on Calculational System Design, Marktoberdorf, Germany, 28 July-9 August 1998, pages 297\u2013301, 1999."},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E. W. Dijkstra","year":"1980","unstructured":"Edsger W. Dijkstra and C.S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1\u20134, 1980.","journal-title":"Information Processing Letters"},{"key":"41_CR7","unstructured":"Yuri Gurevich. Evolving algebras 1993: Lipari guide. In E. B\u00f6rger, editor, Specification and Validation Methods, pages 9\u201336. Oxford University Press, 1995."},{"key":"41_CR8","unstructured":"Yuri Gurevich. May 1997 draft of the ASM guide. Technical Report CSETR-336-97, University of Michigan, 1997."},{"key":"41_CR9","first-page":"93","volume":"67","author":"Y. Gurevich","year":"1999","unstructured":"Yuri Gurevich. The sequential ASM thesis. Bulletin of the European Association for Theoretical Computer Science, 67:93\u2013124, February 1999. Columns: Logic in Computer Science.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"41_CR10","unstructured":"Martin Kronenburg and Christian Peper. The FOREST Approach: World Wide Web page at \n                    http:\/\/rn.informatik.uni-kl.de\/~forest\/\n                    \n                  ."},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Leslie Lamport. On interprocess communication. Distributed Computing, 1:77\u2013101, 1986.","journal-title":"Distributed Computing"},{"issue":"3","key":"41_CR12","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872\u2013923, May 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"41_CR13","volume-title":"1st IEEE International Conference on Formal Engineering Methods 1997 (ICFEM\u201997)","author":"C. Peper","year":"1997","unstructured":"Christian Peper, Reinhard Gotzhein, and Martin Kronenburg. A generic approach to the formal specification of requirements. In 1st IEEE International Conference on Formal Engineering Methods 1997 (ICFEM\u201997), Hiroshima, Japan. IEEE Computer Society, 1997."}],"container-title":["Lecture Notes in Computer Science","FM\u201999 \u2014 Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48118-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:38:21Z","timestamp":1551091101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48118-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665885","9783540481188"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48118-4_41","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}