{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:10Z","timestamp":1725490210601},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642304729"},{"type":"electronic","value":"9783642304736"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30473-6_9","type":"book-chapter","created":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T11:29:12Z","timestamp":1337945352000},"page":"99-114","source":"Crossref","is-referenced-by-count":3,"title":["Test Generation from Recursive Tiles Systems"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Ch\u00e9dor","sequence":"first","affiliation":[]},{"given":"Thierry","family":"J\u00e9ron","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Morvan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44585-4_18","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Analysis of Recursive State Machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 207\u2013220. Springer, Heidelberg (2001)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 202\u2013211. ACM (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"9_CR3","unstructured":"Caucal, D.: Deterministic graph grammars. Texts in Logics and Games, vol.\u00a02, pp. 169\u2013250 (2007)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-03816-7_2","volume-title":"Mathematical Foundations of Computer Science 2009","author":"D. Caucal","year":"2009","unstructured":"Caucal, D.: Synchronization of Regular Automata. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 2\u201323. Springer, Heidelberg (2009)"},{"key":"9_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-79709-8_14","volume-title":"Computer Science \u2013 Theory and Applications","author":"D. Caucal","year":"2008","unstructured":"Caucal, D., Hassen, S.: Synchronization of Grammars. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol.\u00a05010, pp. 110\u2013121. Springer, Heidelberg (2008)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-73066-8_4","volume-title":"Testing of Software and Communicating Systems","author":"C. Constant","year":"2007","unstructured":"Constant, C., Jeannet, B., J\u00e9ron, T.: Automatic Test Generation from Interprocedural Specifications. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) TestCom\/FATES 2007. LNCS, vol.\u00a04581, pp. 41\u201357. Springer, Heidelberg (2007)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of Theoretical Computer Science. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11940197_3","volume-title":"Formal Approaches to Software Testing and Runtime Verification","author":"L. Frantzen","year":"2006","unstructured":"Frantzen, L., Tretmans, J., Willemse, T.A.C.: A Symbolic Framework for Model-Based Testing. In: Havelund, K., N\u00fa\u00f1ez, M., Ro\u015fu, G., Wolff, B. (eds.) FATES 2006 and RV 2006. LNCS, vol.\u00a04262, pp. 40\u201354. Springer, Heidelberg (2006)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10009-004-0153-x","volume":"7","author":"C. Jard","year":"2005","unstructured":"Jard, C., J\u00e9ron, T.: TGV: theory, principles and algorithms. Software Tools for Technology Transfer (STTT)\u00a07(4), 297\u2013315 (2005)","journal-title":"Software Tools for Technology Transfer (STTT)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-74792-5_3","volume-title":"Formal Methods for Components and Objects","author":"B. Jeannet","year":"2007","unstructured":"Jeannet, B., J\u00e9ron, T., Rusu, V.: Model-Based Test Selection for Infinite-State Reactive Systems. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol.\u00a04709, pp. 47\u201369. Springer, Heidelberg (2007)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-74456-6_13","volume-title":"Mathematical Foundations of Computer Science 2007","author":"D. Nowotka","year":"2007","unstructured":"Nowotka, D., Srba, J.: Height-Deterministic Pushdown Automata. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 125\u2013134. Springer, Heidelberg (2007)"},{"key":"9_CR12","unstructured":"Tretmans, G.J., Brinksma, H.: Torx: Automated model-based testing. In: Hartman, A., Dussa-Ziegler, K. (eds.) First European Conference on Model-Driven Software Engineering, pp. 31\u201343 (December 2003)"},{"issue":"3","key":"9_CR13","first-page":"103","volume":"17","author":"J. Tretmans","year":"1996","unstructured":"Tretmans, J.: Test generation with inputs, outputs and repetitive quiescence. Software - Concepts and Tools\u00a017(3), 103\u2013120 (1996)","journal-title":"Software - Concepts and Tools"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30473-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:54:47Z","timestamp":1558299287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30473-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642304729","9783642304736"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30473-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}