{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:20:51Z","timestamp":1776316851796,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642336539","type":"print"},{"value":"9783642336546","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33654-6_20","type":"book-chapter","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T03:47:41Z","timestamp":1347940061000},"page":"294-310","source":"Crossref","is-referenced-by-count":5,"title":["A Truly Concurrent Semantics for the $\\mathbb{K}$ Framework Based on Graph Transformations"],"prefix":"10.1007","author":[{"given":"Traian Florin","family":"\u015eerb\u0103nu\u0163\u0103","sequence":"first","affiliation":[]},{"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term rewriting and all that","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Baldan, P., Gadducci, F., Montanari, U.: Modelling calculi with name mobility using graphs with equivalences. In: TERMGRAPH. ENTCS, vol.\u00a0176(1), pp. 85\u201397 (2007)","DOI":"10.1016\/j.entcs.2006.10.028"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. J. of Theoretical Computer Science\u00a096(1), 217\u2013248 (1992)","journal-title":"J. of Theoretical Computer Science"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation: Basic concepts and double pushout approach. In: Handbook of Graph Grammars, vol.\u00a01, pp. 163\u2013246. World Sci. (1997)","DOI":"10.1142\/9789812384720_0003"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-07854-1_188","volume-title":"Mathematical Foundations of Computer Science 1976","author":"H. Ehrig","year":"1976","unstructured":"Ehrig, H., Kreowski, H.-J.: Parallelism of Manipulations in Multidimensional Information Structures. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol.\u00a045, pp. 284\u2013293. Springer, Heidelberg (1976)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: An algebraic approach. In: SWAT (FOCS), pp. 167\u2013180 (1973)","DOI":"10.1109\/SWAT.1973.11"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Ellison, C., Ro\u015fu, G.: An executable formal semantics of C with applications. In: POPL, pp. 533\u2013544 (2012)","DOI":"10.1145\/2103621.2103719"},{"key":"20_CR8","unstructured":"Felleisen, M., Friedman, D.P.: Control operators, the SECD-machine, and the lambda-calculus. In: 3rd Working Conference on the Formal Description of Programming Concepts, Ebberup, Denmark, pp. 193\u2013219 (August 1986)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-50325-0_5","volume-title":"Recent Trends in Data Type Specification","author":"A. Habel","year":"1988","unstructured":"Habel, A., Kreowski, H.-J., Plump, D.: Jungle Evaluation. In: Sannella, D., Tarlecki, A. (eds.) Abstract Data Types 1987. LNCS, vol.\u00a0332, pp. 92\u2013112. Springer, Heidelberg (1988)"},{"issue":"5","key":"20_CR10","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1017\/S0960129501003425","volume":"11","author":"A. Habel","year":"2001","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science\u00a011(5), 637\u2013688 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1051\/ita\/1991250504451","volume":"25","author":"B. Hoffmann","year":"1991","unstructured":"Hoffmann, B., Plump, D.: Implementing term rewriting by jungle evaluation. RAIRO\u2014Theoretical Informatics and Applications\u00a025, 445\u2013472 (1991)","journal-title":"RAIRO\u2014Theoretical Informatics and Applications"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11768869_15","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"H. Kastenberg","year":"2006","unstructured":"Kastenberg, H., Kleppe, A., Rensink, A.: Defining Object-Oriented Execution Semantics Using Graph Transformations. In: Gorrieri, R., Wehrheim, H. (eds.) FMOODS 2006. LNCS, vol.\u00a04037, pp. 186\u2013201. Springer, Heidelberg (2006)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-08442-8_94","volume-title":"Fundamentals of Computation Theory","author":"H.-J. Kreowski","year":"1977","unstructured":"Kreowski, H.-J.: Transformations of Derivation Sequences in Graph Grammars. In: Karpinski, M. (ed.) FCT 1977. LNCS, vol.\u00a056, pp. 275\u2013286. Springer, Heidelberg (1977)"},{"key":"20_CR14","unstructured":"Meredith, P., Hills, M., Ro\u015fu, G.: An executable rewriting logic semantics of K-Scheme. In: SCHEME, Tech. Rep. DIUL-RT-0701, pp. 91\u2013103. U. Laval (2007)"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. J. of Theoretical Computer Science\u00a096(1), 73\u2013155 (1992)","journal-title":"J. of Theoretical Computer Science"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-61604-7_64","volume-title":"CONCUR \u201996: Concurrency Theory","author":"J. Meseguer","year":"1996","unstructured":"Meseguer, J.: Rewriting Logic as a Semantic Framework for Concurrency. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 331\u2013372. Springer, Heidelberg (1996)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-56625-2_4","volume-title":"Mathematics of Program Construction","author":"U. Montanari","year":"1993","unstructured":"Montanari, U.: True Concurrency: Theory and Practice. In: Bird, R.S., Wing, J.M., Morgan, C.C. (eds.) MPC 1992. LNCS, vol.\u00a0669, pp. 14\u201317. Springer, Heidelberg (1993)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M., Rossi, F.: Modeling concurrent, mobile and coordinated systems via graph transformations. In: Handbook of Graph Grammars, vol.\u00a03, pp. 189\u2013268. World Sci. (1999)","DOI":"10.1142\/9789812814951_0004"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Plump, D.: Term graph rewriting. In: Handbook of Graph Grammars, vol.\u00a02, pp. 3\u201361. World Sci. (1999)","DOI":"10.1142\/9789812815149_0001"},{"issue":"6","key":"20_CR20","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.jlap.2010.03.012","volume":"79","author":"G. Ro\u015fu","year":"2010","unstructured":"Ro\u015fu, G., \u015eerb\u0103nu\u0163\u0103, T.F.: An overview of the K semantic framework. J. of Logic and Algebraic Programming\u00a079(6), 397\u2013434 (2010)","journal-title":"J. of Logic and Algebraic Programming"},{"key":"20_CR21","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.F., Ro\u015fu, G.: KRAM\u2014extended report. Technical Report, UIUC (September 2010), \n                    \n                      http:\/\/hdl.handle.net\/2142\/17337"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A.K. Wright","year":"1994","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Information and Computation\u00a0115(1), 38\u201394 (1994)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33654-6_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:17:49Z","timestamp":1620130669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}