{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:29Z","timestamp":1725489149933},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002253"},{"type":"electronic","value":"9783540362067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36206-1_5","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:23:08Z","timestamp":1187248988000},"page":"37-46","source":"Crossref","is-referenced-by-count":2,"title":["Modeling Software: From Theory to Practice"],"prefix":"10.1007","author":[{"given":"Margus","family":"Veanes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"5_CR1","unstructured":"M. Barnett and W. Schulte. The ABCs of Specification: AsmL, Behavior, and Components, Informatica, 25(4), 2001."},{"key":"5_CR2","unstructured":"M. Barnett and W. Schulte. Contracts, Components, and their Runtime Verification on the.NET Platform, Microsoft Research, Technical Report, MSR-TR-2002-38, 2002. To appear in The Journal of Systems and Software."},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-44518-8","volume-title":"Background, reserve, and Gandy machines","author":"B. Gurevich","year":"2000","unstructured":"Blass and Y. Gurevich. Background, reserve, and Gandy machines, in Proc. Computer Science Logic, Lecture Notes in Computer Science, Vol. 1862, pages 1\u201317, Springer, 2000."},{"key":"5_CR4","unstructured":"Blass and Y. Gurevich. Abstract State Machines Capture Parallel Algorithms. Microsoft Research, Technical Report, MSR-TR-2001-117, 2002. To appear in ACM Transactions on Computational Logic."},{"key":"5_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-60609-2_12","volume-title":"Why use evolving algebras for hardware and software engineering?","author":"E. B\u00f6rger","year":"1995","unstructured":"E. B\u00f6rger. Why use evolving algebras for hardware and software engineering? Lecture Notes in Computer Science, Vol. 1012, pages 236\u2013271, Springer, 1995."},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48257-1_1","volume-title":"Current Trends in Applied Formal Methods (FM-Trends 98)","author":"E. B\u00f6rger","year":"1999","unstructured":"E. B\u00f6rger. High Level System Design and Analysis using Abstract State Machines. In D. Hutter, W. Stephan, P. Traverso, M. Ullman, eds., Current Trends in Applied Formal Methods (FM-Trends 98). Lecture Notes in Computer Science, Vol. 1641, pp. 1\u201343, Springer, 1999."},{"issue":"8","key":"5_CR7","first-page":"2","volume":"2","author":"E. B\u00f6rger","year":"2002","unstructured":"E. B\u00f6rger. The Origins and the Development of the ASM Method for High Level System Design and Analysis. Journal of Universal Computer Science, 2(8): 2\u201374, Springer, 2002.","journal-title":"Journal of Universal Computer Science"},{"key":"5_CR8","unstructured":"E. B\u00f6rger and J. Huggins, Abstract state machines 1988\u20131998: Commented ASM bibliography, Bulletin of EATCS, Nr 64, pages 105\u2013128, 1998."},{"key":"5_CR9","unstructured":"U. Gl\u00e4sser, Y. Gurevich and M. Veanes. An Abstract Communication Model. Microsoft Research, Technical Report, MSR-TR-2002-55, 2002."},{"key":"5_CR10","unstructured":"Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. B\u00f6rger, editor, Specification and Validation Methods, Oxford University Press, pages 9\u201336, 1995."},{"key":"5_CR11","unstructured":"Y. Gurevich, A new thesis, American Mathematical Society Abstracts, p. 317, 1985."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Y. Gurevich. Sequential Abstract State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, vol. 1, no. 1, July 2000, pages 77\u2013111.","journal-title":"ACM Transactions on Computational Logic"},{"issue":"7","key":"5_CR13","first-page":"917","volume":"11","author":"Y. Gurevich","year":"2001","unstructured":"Y. Gurevich and N. Tillmann. Partial Updates: Exploration. Journal of Universal Computer Science, 11(7): 917\u2013951, Springer, 2001.","journal-title":"Journal of Universal Computer Science"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/566171.566190","volume":"27","author":"W. Grieskamp","year":"2002","unstructured":"W. Grieskamp, Y. Gurevich, W. Schulte and M. Veanes. Generating Finite State Machines from Abstract State Machines, ISSTA 02, Software Engineering Notes 27(4) 112\u2013122, ACM, 2002.","journal-title":"ISSTA 02, Software Engineering Notes"},{"key":"5_CR15","unstructured":"W. Reisig. On Gurevich\u2019s Theorem for Sequential ASM, Informatik-Berichte Nr. 160, Humboldt-Universit\u00e4t zu Berlin, Juli 2002."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36206-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T02:29:32Z","timestamp":1550802572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36206-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002253","9783540362067"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36206-1_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}