{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:20:22Z","timestamp":1725484822898},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430759"},{"type":"electronic","value":"9783540455752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45575-2_12","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T01:30:22Z","timestamp":1180575022000},"page":"109-115","source":"Crossref","is-referenced-by-count":0,"title":["A Verification Approach for Distributed Abstract State Machines"],"prefix":"10.1007","author":[{"given":"Robert","family":"Eschbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"unstructured":"Egon B\u00f6rger, Yuri Gurevich, and Dean Rosenzweig. The bakery algorithm: Yet another specification and verification. In E. B\u00f6rger, editor, Specification and Validation Methods, pages 231\u2013243. Oxford University Press, 1995.","key":"12_CR1"},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44518-8_14","volume-title":"Abstract State Machines-Theory and Applications","author":"R. Eschbach","year":"2000","unstructured":"Robert Eschbach, Uwe Gl\u00e4sser, Reinhard Gotzhein, and Andreas Prinz. On the Formal Semantics of SDL-2000: A Compilation Approach Based on an Abstract SDL Machine. In Y. Gurevich, P.W. Kutter, M. Odersky, and L. Thiele, editors, Abstract State Machines-Theory and Applications, number 1912 in LNCS. Springer, 2000."},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1007\/3-540-48118-4_41","volume-title":"A termination detection algorithm: Specification and verification","author":"R. Eschbach","year":"1999","unstructured":"Robert Eschbach. A termination detection algorithm: Specification and verification. In Jeanette M. Wing, Jim Woodcock, and Jim Davies, editors, Proc. of FM\u201999-World Congress on Formal Methods in the Development of Computing Systems, number 1709 in LNCS, pages 1720\u20131737, 1999."},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-56992-8_17","volume-title":"Selected papers fromCSL\u201992 (Computer Science Logic)","author":"Y. Gurevich","year":"1993","unstructured":"Yuri Gurevich and James K. Huggins. The semantics of the c programming language. In Selected papers fromCSL\u201992 (Computer Science Logic), LNCS, pages 274\u2013308. Springer, 1993."},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-44518-8_9","volume-title":"Abstract State Machines: Theory and Applications","author":"Y. Gurevich","year":"2000","unstructured":"Yuri Gurevich and Dean Rosenzweig. Partially ordered runs: A case study. In Yuri Gurevich, Philipp W. Kutter, Martin Odersky, and Lothar Thiele, editors, Abstract State Machines: Theory and Applications, Proc. of International Workshop, ASM2000, Monte Verit\u00e0, Switzerland, number 1912 in LNCS, pages 131\u2013150. Springer, March 2000."},{"unstructured":"Yuri Gurevich. Evolving Algebras 1993: Lipari Guide. In E. B\u00f6rger, editor, Specification and Validation Methods. Oxford Univ. Press, 1995.","key":"12_CR6"},{"unstructured":"Yuri Gurevich. May 1997 draft of the ASM guide. Technical Report CSE-TR-336-97, University of Michigan, 1997.","key":"12_CR7"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Yuri Gurevich. Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic, 1(1):77\u2013111, July 2000.","journal-title":"ACM Transactions on Computational Logic"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45575-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:25:58Z","timestamp":1550366758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45575-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430759","9783540455752"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45575-2_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}