{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:15:46Z","timestamp":1725747346308},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410352"},{"type":"electronic","value":"9783642410369"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41036-9_10","type":"book-chapter","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T05:49:49Z","timestamp":1378187389000},"page":"96-108","source":"Crossref","is-referenced-by-count":3,"title":["Modular Synthesis with Open Components"],"prefix":"10.1007","author":[{"given":"Ilaria","family":"De Crescenzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"La Torre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1145\/1075382.1075387","volume":"27","author":"R. Alur","year":"2005","unstructured":"Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of recursive state machines. ACM Trans. Program. Lang. Syst.\u00a027(4), 786\u2013818 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-45069-6_6","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2003","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Modular strategies for infinite games on recursive graphs. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 67\u201379. Springer, Heidelberg (2003)"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.tcs.2005.11.017","volume":"354","author":"R. Alur","year":"2006","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Modular strategies for recursive game graphs. Theor. Comput. Sci.\u00a0354(2), 230\u2013249 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-35743-5_4","volume-title":"Formal Aspects of Component Software","author":"B. Aminof","year":"2012","unstructured":"Aminof, B., Mogavero, F., Murano, A.: Synthesis of hierarchical systems. In: Arbab, F., \u00d6lveczky, P.C. (eds.) FACS 2011. LNCS, vol.\u00a07253, pp. 42\u201360. Springer, Heidelberg (2012)"},{"key":"10_CR5","unstructured":"De Crescenzo, I., La Torre, S.: Winning caret games with modular strategies. In: Fioravanti, F. (ed.) CILC. CEUR Workshop Proceedings, vol.\u00a0810, pp. 327\u2013331. CEUR-WS.org (2011)"},{"key":"10_CR6","unstructured":"De Crescenzo, I., La Torre, S.: Visibly pushdown modular games. Technical Report, University of Salerno, pp. 1\u201319 (2013)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-642-31424-7_41","volume-title":"Computer Aided Verification","author":"W.R. Harris","year":"2012","unstructured":"Harris, W.R., Jha, S., Reps, T.: Secure programming via visibly pushdown safety games. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol.\u00a07358, pp. 581\u2013598. Springer, Heidelberg (2012)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Jha, S., Gulwani, S., Seshia, S.A., Tiwari, A.: Oracle-guided component-based program synthesis. In: Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering (ICSE), pp. 215\u2013224 (May 2010)","DOI":"10.1145\/1806799.1806833"},{"issue":"9-10","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.ic.2008.03.017","volume":"206","author":"S. Torre La","year":"2008","unstructured":"La Torre, S., Napoli, M., Parente, M., Parlato, G.: Verification of scope-dependent hierarchical state machines. Inf. Comput.\u00a0206(9-10), 1161\u20131177 (2008)","journal-title":"Inf. Comput."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-00596-1_28","volume-title":"Foundations of Software Science and Computational Structures","author":"Y. Lustig","year":"2009","unstructured":"Lustig, Y., Vardi, M.Y.: Synthesis from component libraries. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 395\u2013409. Springer, Heidelberg (2009)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Lustig, Y., Vardi, M.Y.: Synthesis from recursive-components libraries. In: D\u2019Agostino, G., La Torre, S. (eds.) GandALF. EPTCS, vol.\u00a054, pp. 1\u201316 (2011)","DOI":"10.4204\/EPTCS.54.1"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic\u00a065(2), 149\u2013184 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: Infinite games and verification (Extended abstract of a tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 58\u201364. Springer, Heidelberg (2002)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00596-1_1","volume-title":"Foundations of Software Science and Computational Structures","author":"W. Thomas","year":"2009","unstructured":"Thomas, W.: Facets of synthesis: Revisiting church\u2019s problem. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 1\u201314. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41036-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T21:32:05Z","timestamp":1558042325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41036-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410352","9783642410369"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41036-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}