{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:42:49Z","timestamp":1759941769909,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232070"},{"type":"electronic","value":"9783540302032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30203-2_15","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T18:59:27Z","timestamp":1285095567000},"page":"194-209","source":"Crossref","is-referenced-by-count":13,"title":["Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"St\u00fcrmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/633642.803973","volume":"4","author":"T. Agerwala","year":"1973","unstructured":"Agerwala, T., Flynn, M.: Comments on capabilities, limitations and \u201ccorrectness\u201d of Petri nets. Computer Architecture News\u00a04(2), 81\u201386 (1973)","journal-title":"Computer Architecture News"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/363911.363914","volume":"22","author":"U. Assmann","year":"2000","unstructured":"Assmann, U.: Graph rewrite systems for program optimization. TOPLAS\u00a022(4), 583\u2013637 (2000)","journal-title":"TOPLAS"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-44618-4_32","volume-title":"CONCUR 2000 - Concurrency Theory","author":"P. Baldan","year":"2000","unstructured":"Baldan, P., Busi, N., Corradini, A., Pinna, G.M.: Functorial concurrent semantics for Petri nets with read and inhibitor arcs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 442\u2013457. Springer, Heidelberg (2000)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-49019-1_6","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Baldan","year":"1999","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Unfolding and event structure semantics for graph grammars. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 73\u201389. Springer, Heidelberg (1999)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-45832-8_4","volume-title":"Graph Transformation","author":"P. Baldan","year":"2002","unstructured":"Baldan, P., K\u00f6nig, B.: Approximating the behaviour of graph transformation systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 14\u201329. Springer, Heidelberg (2002)"},{"issue":"9","key":"15_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/S0950-5849(97)00017-7","volume":"39","author":"A.S. Boujarwah","year":"1997","unstructured":"Boujarwah, A.S., Saleh, K.: Compiler test case generation methods: a survey and assessment. Information and Software Technology\u00a039(9), 617\u2013625 (1997)","journal-title":"Information and Software Technology"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-61363-3_7","volume-title":"Application and Theory of Petri Nets 1996","author":"N. Busi","year":"1996","unstructured":"Busi, N., Pinna, G.M.: Non sequential semantics for contextual P\/T nets. In: Billington, J., Reisig, W. (eds.) ICATPN 1996. LNCS, vol.\u00a01091, pp. 113\u2013132. Springer, Heidelberg (1996)"},{"key":"15_CR8","series-title":"Foundations","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation \u2013 part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a01, ch. 3, World Scientific, Singapore (1997)"},{"key":"15_CR9","series-title":"Foundations","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"H. Ehrig","year":"1997","unstructured":"Ehrig, H., Heckel, R., Korff, M., L\u00f6we, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation \u2013 part II: Single pushout approach and comparison with double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a01, ch. 4, World Scientific, Singapore (1997)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.: Graph grammars: An algebraic approach. In: Proc. 14th IEEE Symp. on Switching and Automata Theory, pp. 167\u2013180 (1973)","DOI":"10.1109\/SWAT.1973.11"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Glesner, S., Gei\u00df, R., Boesler, B.: Verified code generation for embedded systems. In: Proceedings of the COCV-Workshop (Compiler Optimization meets Compiler Verification). ENTCS, vol.\u00a065.2 (2002)","DOI":"10.1016\/S1571-0661(04)80394-3"},{"issue":"11","key":"15_CR12","first-page":"1296","volume":"9","author":"G. Karsai","year":"2003","unstructured":"Karsai, G., Agrawal, A., Shi, F., Sprinkle, J.: On the use of graph transformation in the formal specification of model interpreters. Journal of Universal Computer Science\u00a09(11), 1296\u20131321 (2003)","journal-title":"Journal of Universal Computer Science"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Montanari, U., Rossi, F.: Contextual nets. Acta Informatica\u00a032(6) (1995)","DOI":"10.1007\/BF01178907"},{"key":"15_CR14","unstructured":"Neema, S., Karsai, G.: Embedded control systems language for distributed processing (ECSL-DP). Technical Report ISIS-04-505, Vanderbilt University (2004)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, Part 1. Theoretical Computer Science\u00a013, 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s002360050099","volume":"34","author":"A. Nymeyer","year":"1997","unstructured":"Nymeyer, A., Katoen, J.-P.: Code generation based on formal BURS theory and heuristic search. Acta Informatica\u00a034, 597\u2013635 (1997)","journal-title":"Acta Informatica"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Purdom, P.: A sentence generation for testing parsers. BIT, pp. 366\u2013375 (1972)","DOI":"10.1007\/BF01932308"},{"key":"15_CR18","unstructured":"Ribeiro, L.: Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universit\u00e4t Berlin (1996)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"St\u00fcrmer, I., Conrad, M.: Test suite design for code generation tools. In: Proc. 18th IEEE Automated Software Engineering (ASE) Conference, pp. 286\u2013290 (2003)","DOI":"10.1109\/ASE.2003.1240322"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30203-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:44:45Z","timestamp":1740527085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30203-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232070","9783540302032"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30203-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}