{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:07:39Z","timestamp":1725566859834},"publisher-location":"Berlin, Heidelberg","reference-count":67,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540236115"},{"type":"electronic","value":"9783540304722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30472-2_5","type":"book-chapter","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T20:07:39Z","timestamp":1285272459000},"page":"65-84","source":"Crossref","is-referenced-by-count":2,"title":["A Practice-Oriented Course on the Principles of Computation, Programming, and System Design and Analysis"],"prefix":"10.1007","author":[{"given":"Egon","family":"B\u00f6rger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/275487.275507","volume-title":"Proc. 17th ACM Sympos. Principles of Database Systems (PODS 1998)","author":"S. Abiteboul","year":"1998","unstructured":"Abiteboul, S., Vianu, V., Fordham, B., Yesha, Y.: Relational transducers for electronic commerce. In: Proc. 17th ACM Sympos. Principles of Database Systems (PODS 1998), pp. 179\u2013187. ACM Press, New York (1998)"},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book","author":"J.-R. Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B-Book. Cambridge University Press, Cambridge (1996)"},{"unstructured":"Anlauff, M., Kutter, P.: Xasm Open Source. Web pages (2001), at http:\/\/www.xasm.org\/","key":"5_CR3"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-44518-8_21","volume-title":"Abstract State Machines - Theory and Applications","author":"M. Barnett","year":"2000","unstructured":"Barnett, M., B\u00f6rger, E., Gurevich, Y., Schulte, W., Veanes, M.: Using Abstract State Machines at Microsoft: A case study. In: Gurevich, Y., Kutter, P., Odersky, M., Thiele, L. (eds.) ASM 2000. LNCS, vol.\u00a01912, pp. 367\u2013380. Springer, Heidelberg (2000)"},{"unstructured":"Barnett, M., Schulte, W.: Contracts, components and their runtime verification on the .NET platform. J. Systems and Software, Special Issue on Component-Based Software Engineering (2002) (to appear)","key":"5_CR5"},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/BF01211908","volume":"8","author":"C. Beierle","year":"1996","unstructured":"Beierle, C., B\u00f6rger, E.: Refinement of a typed WAM extension by polymorphic order-sorted types. Formal Aspects of Computing\u00a08(5), 539\u2013564 (1996)","journal-title":"Formal Aspects of Computing"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/BF01213533","volume":"8","author":"C. Beierle","year":"1996","unstructured":"Beierle, C., B\u00f6rger, E.: Specification and correctness proof of a WAM extension with abstract type constraints. Formal Aspects of Computing\u00a08(4), 428\u2013462 (1996)","journal-title":"Formal Aspects of Computing"},{"doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y.: Abstract State Machines capture parallel algorithms. ACM Trans. Computational Logic (2002)","key":"5_CR8","DOI":"10.1145\/937555.937561"},{"key":"5_CR9","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Computability, Complexity, Logic (English translation of \u201dBerechenbarkeit, Komplexit\u00e4t, Logik\u201d)","author":"E. B\u00f6rger","year":"1989","unstructured":"B\u00f6rger, E.: Computability, Complexity, Logic (English translation of \u201dBerechenbarkeit, Komplexit\u00e4t, Logik\u201d). Studies in Logic and the Foundations of Mathematics, vol.\u00a0128. North-Holland, Amsterdam (1989)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48257-1_1","volume-title":"Applied Formal Methods - FM-Trends 98","author":"E. B\u00f6rger","year":"1999","unstructured":"B\u00f6rger, E.: High-level system design and analysis using Abstract State Machines. In: Hutter, D., Stephan, W., Traverso, P., Ullmann, M. (eds.) FM-Trends 1998. LNCS, vol.\u00a01641, pp. 1\u201343. Springer, Heidelberg (1999)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-39910-0_6","volume-title":"Verification: Theory and Practice","author":"E. B\u00f6rger","year":"2004","unstructured":"B\u00f6rger, E.: The ASM ground model method as a foundation of requirements engineering. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 145\u2013160. Springer, Heidelberg (2004)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00165-003-0012-7","volume":"15","author":"E. B\u00f6rger","year":"2003","unstructured":"B\u00f6rger, E.: The ASM refinement method. Formal Aspects of Computing\u00a015, 237\u2013257 (2003)","journal-title":"Formal Aspects of Computing"},{"unstructured":"B\u00f6rger, E.: Teaching ASMs to practice-oriented students. In: Teaching Formal Methods Workshop, pp. 5\u201312. Oxford Brookes University (2003)","key":"5_CR13"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/1-4020-7991-5_16","volume-title":"Languages for System Specification and Verification, CHDL","author":"E. B\u00f6rger","year":"2004","unstructured":"B\u00f6rger, E.: Linking architectural and component level system views by abstract state machines. In: Grimm, C. (ed.) Languages for System Specification and Verification, CHDL, pp. 247\u2013269. Kluwer, Dordrecht (2004)"},{"key":"5_CR15","series-title":"GI-Edition Lecture Notes in Informatics","first-page":"235","volume-title":"Modellierung 2004","author":"E. B\u00f6rger","year":"2004","unstructured":"B\u00f6rger, E.: Modeling with Abstract State Machines: A support for accurate system design and analysis. In: Rumpe, B., Hesse, W. (eds.) Modellierung 2004. GI-Edition Lecture Notes in Informatics, vol.\u00a0P-45, pp. 235\u2013239. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"B\u00f6rger, E.: Abstract State Machines: A unifying view of models of computation and of system design frameworks. Annals of Pure and Applied Logic (2004) (to appear)","key":"5_CR16","DOI":"10.1016\/j.apal.2004.10.007"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-36498-6_12","volume-title":"Abstract State Machines 2003. Advances in Theory and Practice","author":"E. B\u00f6rger","year":"2003","unstructured":"B\u00f6rger, E., Bolognesi, T.: Remarks on turbo ASMs for computing functional equations and recursion schemes. In: B\u00f6rger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol.\u00a02589, pp. 218\u2013228. Springer, Heidelberg (2003)"},{"unstructured":"B\u00f6rger, E., Busch, H., Cuellar, J., P\u00e4ppinghaus, P., Tiden, E., Wildgruber, I.: Konzept einer hierarchischen Erweiterung von EURIS. Siemens ZFE T SE 1 Internal Report BBCPTW91-1, pp. 1\u201343 (Summer 1996)","key":"5_CR18"},{"unstructured":"B\u00f6rger, E., D\u00e4ssler, K.: Prolog: DIN papers for discussion. ISO\/IEC JTCI SC22 WG17 Prolog Standardization Document 58, National Physical Laboratory, Middlesex, England (1990)","key":"5_CR19"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1093\/comjnl\/39.1.52","volume":"39","author":"E. B\u00f6rger","year":"1996","unstructured":"B\u00f6rger, E., Durdanovi\u0107, I.: Correctness of compiling Occam to Transputer code. Computer Journal\u00a039(1), 52\u201392 (1996)","journal-title":"Computer Journal"},{"unstructured":"B\u00f6rger, E., Fruja, G., Gervasi, V., St\u00e4rk, R.: A high-level modular definition of the semantics of C#. Theoretical Computer Science (2004)","key":"5_CR21"},{"key":"5_CR22","first-page":"500","volume-title":"EURO-DAC 1994. European Design Automation Conference with EURO-VHDL 1994","author":"E. B\u00f6rger","year":"1994","unstructured":"B\u00f6rger, E., Gl\u00e4sser, U., M\u00fcller, W.: The semantics of behavioral VHDL 1993 descriptions. In: EURO-DAC 1994. European Design Automation Conference with EURO-VHDL 1994, pp. 500\u2013505. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"5_CR23","series-title":"Technology\/Foundations","first-page":"410","volume-title":"IFIP 13th World Computer Congress","author":"E. B\u00f6rger","year":"1994","unstructured":"B\u00f6rger, E., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: A model for mathematical analysis of functional logic programs and their implementations. In: Pehrson, B., Simon, I. (eds.) IFIP 13th World Computer Congress. Technology\/Foundations, vol.\u00a0I, pp. 410\u2013415. Elsevier, Amsterdam (1994)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0027289","volume-title":"ZUM\u201997: The Z Formal Specification Notation","author":"E. B\u00f6rger","year":"1997","unstructured":"B\u00f6rger, E., Mazzanti, S.: A practical method for rigorously controllable hardware design. In: Bowen, J.P., Hinchey, M.B., Till, D. (eds.) ZUM 1997. LNCS, vol.\u00a01212, pp. 151\u2013187. Springer, Heidelberg (1997)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-44518-8_20","volume-title":"Abstract State Machines: Theory and Applications","author":"E. B\u00f6rger","year":"2000","unstructured":"B\u00f6rger, E., P\u00e4ppinghaus, P., Schmid, J.: Report on a practical application of ASMs in software design. In: Gurevich, Y., Kutter, P., Odersky, M., Thiele, L. (eds.) ASM 2000. LNCS, vol.\u00a01912, pp. 361\u2013366. Springer, Heidelberg (2000)"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6423(95)00006-E","volume":"24","author":"E. B\u00f6rger","year":"1995","unstructured":"B\u00f6rger, E., Rosenzweig, D.: A mathematical definition of full Prolog. Science of Computer Programming\u00a024, 249\u2013286 (1995)","journal-title":"Science of Computer Programming"},{"key":"5_CR27","series-title":"ch. 2, Studies in Computer Science and Artificial Intelligence","first-page":"20","volume-title":"Logic Programming: Formal Methods and Practical Applications","author":"E. B\u00f6rger","year":"1995","unstructured":"B\u00f6rger, E., Rosenzweig, D.: The WAM \u2013 definition and compiler correctness. In: Beierle, C., Pl\u00fcmer, L. (eds.) Logic Programming: Formal Methods and Practical Applications. ch. 2, Studies in Computer Science and Artificial Intelligence, vol.\u00a011, pp. 20\u201390. North-Holland, Amsterdam (1995)"},{"key":"5_CR28","first-page":"97","volume-title":"Specification and Validation Methods","author":"E. B\u00f6rger","year":"1995","unstructured":"B\u00f6rger, E., Salamone, R.: CLAM specification for provably correct compilation of CLP(R) programs. In: B\u00f6rger, E. (ed.) Specification and Validation Methods, pp. 97\u2013130. Oxford University Press, Oxford (1995)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44622-2_3","volume-title":"Computer Science Logic","author":"E. B\u00f6rger","year":"2000","unstructured":"B\u00f6rger, E., Schmid, J.: Composition and submachine concepts for sequential ASMs. In: Clote, P., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 41\u201360. Springer, Heidelberg (2000)"},{"key":"5_CR30","volume-title":"A Method for High-Level System Design and Analysis","author":"E. B\u00f6rger","year":"2003","unstructured":"B\u00f6rger, E., St\u00e4rk, R.F.: Abstract State Machines. In: A Method for High-Level System Design and Analysis, Springer, Heidelberg (2003)"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-30101-1_3","volume-title":"Formal Methods for Components and Objects","author":"E. B\u00f6rger","year":"2004","unstructured":"B\u00f6rger, E., St\u00e4rk, R.F.: Exploiting abstraction for specification reuse. The Java\/C# case study. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2003. LNCS, vol.\u00a03188, pp. 42\u201376. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Burgard, W., Cremers, A.B., Fox, D., Heidelbach, M., Kappel, A.M., L\u00fcttringhaus-Kappel, S.: Knowledge-enhanced CO-monitoring in coal mines. In: Proc. Int. Conf. on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA-AIE), Fukuoka, Japan, June 4-7, pp. 511\u2013521 (1996)","key":"5_CR32","DOI":"10.1201\/9780429332111-86"},{"unstructured":"Castillo, G.D., P\u00e4ppinghaus, P.: Designing software for internet telephony: experiences in an industrial development process. In: Blass, A., B\u00f6rger, E., Gurevich, Y. (eds.) Theory and Applications of Abstract State Machines, Schloss Dagstuhl, Int. Conf. and Research Center for Computer Science (2002)","key":"5_CR33"},{"doi-asserted-by":"crossref","unstructured":"Burgard, W., Cremers, A.B., Fox, D., Heidelbach, M., Kappel, A.M., L\u00fcttringhaus-Kappel, S.: Knowledge-enhanced CO-monitoring in coal mines. In: Proc. Int. Conf. on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA-AIE), Fukuoka, Japan, June 4-7, pp. 511\u2013521 (1996)","key":"5_CR34","DOI":"10.1201\/9780429332111-86"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-46419-0_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Castillo Del","year":"2000","unstructured":"Del Castillo, G., Winter, K.: Model checking support for the ASM high-language. In: Graf, S., Schwartzbach, M. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 331\u2013346. Springer, Heidelberg (2000)"},{"unstructured":"Dold, A.: A formal representation of Abstract State Machines using PVS. Verifix Technical Report Ulm\/6.2, Universit\u00e4t Ulm, Germany (July 1998)","key":"5_CR36"},{"unstructured":"Dold, A., Gaul, T., Vialard, V., Zimmermann, W.: ASM-based mechanized verification of compiler back-ends. In: Gl\u00e4sser, U., Schmitt, P. (eds.) Proc. Int. Workshop on Abstract State Machines, pp. 50\u201367. Magdeburg University (1998)","key":"5_CR37"},{"unstructured":"Fahland, D.: Ein Ansatz einer Formalen Semantik der Business Process Execution Language for Web Services mit Abstract State Machines. Master\u2019s thesis, Humboldt-Universit\u00e4t zu Berlin (June 2004)","key":"5_CR38"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-24773-9_7","volume-title":"Abstract State Machines 2004. Advances in Theory and Practice","author":"R. Farahbod","year":"2004","unstructured":"Farahbod, R., Gl\u00e4sser, U., Vajihollahi, M.: Specification and validation of business process execution language for web services. In: Zimmermann, W., Thalheim, B. (eds.) ASM 2004. LNCS, vol.\u00a03052, pp. 78\u201394. Springer, Heidelberg (2004)"},{"unstructured":"Foundations of Software Engineering Group, Microsoft Research. AsmL (2001), pages at http:\/\/research.microsoft.com\/foundations\/AsmL\/","key":"5_CR40"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-36498-6_14","volume-title":"Abstract State Machines 2003. Advances in Theory and Practice","author":"N.G. Fruja","year":"2003","unstructured":"Fruja, N.G., St\u00e4rk, R.F.: The hidden computation steps of turbo Abstract State Machines. In: B\u00f6rger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol.\u00a02589, pp. 244\u2013262. Springer, Heidelberg (2003)"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-44518-8_17","volume-title":"Abstract State Machines - Theory and Applications","author":"A. Gargantini","year":"2000","unstructured":"Gargantini, A., Riccobene, E.: Encoding Abstract State Machines in PVS. In: Gurevich, Y., Kutter, P., Odersky, M., Thiele, L. (eds.) ASM 2000. LNCS, vol.\u00a01912, pp. 303\u2013322. Springer, Heidelberg (2000)"},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-36498-6_15","volume-title":"Abstract State Machines 2003. Advances in Theory and Practice","author":"A. Gargantini","year":"2003","unstructured":"Gargantini, A., Riccobene, E.: Using Spin to generate tests from ASM specifications. In: B\u00f6rger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol.\u00a02589, pp. 263\u2013277. Springer, Heidelberg (2003)"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-36498-6_16","volume-title":"Abstract State Machines 2003. Advances in Theory and Practice","author":"A. Gawanmeh","year":"2003","unstructured":"Gawanmeh, A., Tahar, S., Winter, K.: Interfacing ASMs with the MDG tool. In: B\u00f6rger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol.\u00a02589, pp. 278\u2013292. Springer, Heidelberg (2003)"},{"issue":"3","key":"5_CR45","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S1389-1286(03)00247-0","volume":"42","author":"U. Gl\u00e4sser","year":"2003","unstructured":"Gl\u00e4sser, U., Gotzhein, R., Prinz, A.: Formal semantics of SDL-2000: Status perspectives. Computer Networks\u00a042(3), 343\u2013358 (2003)","journal-title":"Computer Networks"},{"issue":"1","key":"5_CR46","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential Abstract State Machines capture sequential algorithms. ACM Trans. Computational Logic\u00a01(1), 77\u2013111 (2000)","journal-title":"ACM Trans. Computational Logic"},{"unstructured":"Heitmeyer, C.: Using SCR methods to capture, document, and verify computer system requirements. In: B\u00f6rger, E., H\u00f6rger, B., Parnas, D.L., Rombach, D. (eds.) Requirements Capture, Documentation, and Validation. Dagstuhl Seminar No. 99241, Schloss Dagstuhl, Int. Conf. and Research Center for Computer Science (1999)","key":"5_CR47"},{"doi-asserted-by":"crossref","unstructured":"Heitmeyer, C.: Software cost reduction. In: Marciniak, J.J. (ed.) Enc. of Software Engineering, 2nd edn. (2002)","key":"5_CR48","DOI":"10.21236\/ADA465161"},{"unstructured":"ITU-T. SDL formal semantics definition. ITU-T Recommendation Z.100 Annex F, International Telecommunication Union (November 2000)","key":"5_CR49"},{"key":"5_CR50","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/BF00985318","volume":"17","author":"D.E. Johnson","year":"1994","unstructured":"Johnson, D.E., Moss, L.S.: Grammar formalisms viewed as Evolving Algebras. Linguistics and Philosophy\u00a017, 537\u2013560 (1994)","journal-title":"Linguistics and Philosophy"},{"key":"5_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-36498-6_29","volume-title":"Abstract State Machines 2003. Advances in Theory and Practice","author":"A. Kalinov","year":"2003","unstructured":"Kalinov, A., Kossatchev, A., Petrenko, A., Posypkin, M., Shishkov, V.: Using ASM specifications for compiler testing. In: B\u00f6rger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol.\u00a02589, p. 415. Springer, Heidelberg (2003)"},{"key":"5_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-48257-1_12","volume-title":"Applied Formal Methods - FM-Trends 98","author":"P. Kutter","year":"1998","unstructured":"Kutter, P., Schweizer, D., Thiele, L.: Integrating domain specific language design in the software life cycle. In: Hutter, D., Traverso, P. (eds.) FM-Trends 1998. LNCS, vol.\u00a01641, pp. 196\u2013212. Springer, Heidelberg (1998)"},{"key":"5_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-24773-9_3","volume-title":"Abstract State Machines 2004. Advances in Theory and Practice","author":"H. Langmaack","year":"2004","unstructured":"Langmaack, H.: An ALGLO-view on TURBO ASM. In: Zimmermann, W., Thalheim, B. (eds.) ASM 2004. LNCS, vol.\u00a03052, pp. 20\u201337. Springer, Heidelberg (2004)"},{"key":"5_CR54","first-page":"97","volume-title":"SystemC - Methodologies and Applications","author":"W. Mueller","year":"2003","unstructured":"Mueller, W., Ruf, J., Rosenstiel, W.: An ASM-based semantics of systemC simulation. In: Mueller, W., Ruf, J., Rosenstiel, W. (eds.) SystemC - Methodologies and Applications, pp. 97\u2013126. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"5","key":"5_CR55","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00236-002-0106-3","volume":"39","author":"W. Reisig","year":"2003","unstructured":"Reisig, W.: On Gurevich\u2019s theorem on sequential algorithms. Acta Informatica\u00a039(5), 273\u2013305 (2003)","journal-title":"Acta Informatica"},{"issue":"4","key":"5_CR56","first-page":"377","volume":"3","author":"G. Schellhorn","year":"1997","unstructured":"Schellhorn, G., Ahrendt, W.: Reasoning about Abstract State Machines: The WAM case study. J. Universal Computer Science\u00a03(4), 377\u2013413 (1997)","journal-title":"J. Universal Computer Science"},{"unstructured":"Schmid, J.: Executing ASM specifications with AsmGofer. Web, pages at http:\/\/www.tydo.de\/AsmGofer","key":"5_CR57"},{"unstructured":"Schmid, J.: Refinement and Implementation Techniques for Abstract State Machines. PhD thesis, University of Ulm, Germany (2002)","key":"5_CR58"},{"key":"5_CR59","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0022-0000(67)80014-X","volume":"1","author":"D. Scott","year":"1967","unstructured":"Scott, D.: Definitional suggestions for automata theory. J. Computer and System Sciences\u00a01, 187\u2013212 (1967)","journal-title":"J. Computer and System Sciences"},{"unstructured":"St\u00e4rk, R.F.: Formal verification of the C# thread model. Department of Computer Science, ETH Z\u00fcrich (2004)","key":"5_CR60"},{"key":"5_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-24773-9_4","volume-title":"Abstract State Machines 2004. Advances in Theory and Practice","author":"R.F. St\u00e4rk","year":"2004","unstructured":"St\u00e4rk, R.F., B\u00f6rger, E.: An ASM specification of C# threads and the.NET memory model. In: Zimmermann, W., Thalheim, B. (eds.) ASM 2004. LNCS, vol.\u00a03052, pp. 38\u201360. Springer, Heidelberg (2004)"},{"key":"5_CR62","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59495-3","volume-title":"Java and the Java Virtual Machine: Definition, Verification, Validation","author":"R.F. St\u00e4rk","year":"2001","unstructured":"St\u00e4rk, R.F., Schmid, J., B\u00f6rger, E.: Java and the Java Virtual Machine: Definition, Verification, Validation. Springer, Heidelberg (2001)"},{"unstructured":"Teich, J.: Project Buildabong at University of Paderborn (2001), http:\/\/www-date.upb.de\/RESEARCH\/BUILDABONG\/buildabong.html","key":"5_CR63"},{"key":"5_CR64","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/354880.354885","volume-title":"Proc. Int. Conf. on Compilers, Architectures and Synthesis for Embedded Systems (CASES2000)","author":"J. Teich","year":"2000","unstructured":"Teich, J., Weper, R., Fischer, D., Trinkert, S.: A joint architecture\/compiler design environment for ASIPs. In: Proc. Int. Conf. on Compilers, Architectures and Synthesis for Embedded Systems (CASES2000), San Jose, CA, USA, November 2000, pp. 26\u201333. ACM Press, New York (2000)"},{"unstructured":"Vajihollahi, M.: High level specification and validation of the business process execution language for web services. Master\u2019s thesis, School of Computing Science at Simon Fraser University (March 2004)","key":"5_CR65"},{"key":"5_CR66","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/253769.253801","volume":"40","author":"P. Wegner","year":"1997","unstructured":"Wegner, P.: Why interaction is more powerful than algorithms. Commun. ACM\u00a040, 80\u201391 (1997)","journal-title":"Commun. ACM"},{"issue":"5","key":"5_CR67","first-page":"689","volume":"3","author":"K. Winter","year":"1997","unstructured":"Winter, K.: Model checking for Abstract State Machines. J. Universal Computer Science\u00a03(5), 689\u2013701 (1997)","journal-title":"J. Universal Computer Science"}],"container-title":["Lecture Notes in Computer Science","Teaching Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30472-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T13:14:19Z","timestamp":1685798059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30472-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540236115","9783540304722"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30472-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}