{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:39:06Z","timestamp":1743111546221,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030853143"},{"type":"electronic","value":"9783030853150"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85315-0_19","type":"book-chapter","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T12:05:42Z","timestamp":1629374742000},"page":"334-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reactive Synthesis from Visibly Register Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Ryoma","family":"Senda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Takata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: 36th ACM Symposium Theory of Computing (STOC 2004) (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/978-3-319-10575-8_27","volume-title":"Handbook of Model Checking","author":"R Bloem","year":"2018","unstructured":"Bloem, R., Chatterjee, K., Jobstmann, B.: Graph games and reactive synthesis. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 921\u2013962. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_27"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Logic 12(4) (2011)","DOI":"10.1145\/1970398.1970403"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Logical Methods Comput. Sci. 10(3:4), 1\u201344 (2014)","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-28729-9_26","volume-title":"Foundations of Software Science and Computational Structures","author":"B Bollig","year":"2012","unstructured":"Bollig, B., Cyriac, A., Gastin, P., Narayan Kumar, K.: Model checking languages of data words. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 391\u2013405. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_26"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR \u201997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63141-0_10"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(02)00229-6","volume":"84","author":"P Bouyer","year":"2002","unstructured":"Bouyer, P.: A logical characterization of data languages. Inform. Process. Lett. 84(2), 75\u201385 (2002)","journal-title":"Inform. Process. Lett."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"JR B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Am. Math. Soc. 138, 295\u2013311 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y.-F., Leng\u00e1l, O., Tan, T., Wu, Z.: Register automata with linear arithmetic. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2017) (2017)","DOI":"10.1109\/LICS.2017.8005111"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"EYC Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica 35, 245\u2013267 (1998)","journal-title":"Acta Informatica"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50026-6","volume-title":"Model Checking","author":"EM Clarke","year":"2001","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2001)"},{"key":"19_CR12","unstructured":"Clemente, L., Lasota, S.: Reachability analysis of first-order definable pushdown systems. In: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), pp. 244\u2013259 (2015)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-25540-4_1","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2019","unstructured":"D\u2019Antoni, L., Ferreira, T., Sammartino, M., Silva, A.: Symbolic register automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 3\u201321. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_1"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazi\u0107, R.: LTL with freeze quantifier and register automata. ACM Trans. Comput. Logic 10(3) (2009)","DOI":"10.1145\/1507244.1507246"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ic.2006.08.003","volume":"205","author":"S Demri","year":"2007","unstructured":"Demri, S., Lazi\u0107, R., Nowak, D.: On the freeze quantifier in constraint LTL: decidability and complexity. Inform. Comput. 205(1), 2\u201324 (2007)","journal-title":"Inform. Comput."},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-54013-4_23","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R Ehlers","year":"2014","unstructured":"Ehlers, R., Seshia, S.A., Kress-Gazit, H.: Synthesis with identifiers. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 415\u2013433. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54013-4_23"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 232\u2013247. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_20"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0890-5401(03)00139-1","volume":"186","author":"J Esparza","year":"2003","unstructured":"Esparza, J., Ku\u010dera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Inform. Comput. 186(2), 355\u2013376 (2003)","journal-title":"Inform. Comput."},{"key":"19_CR19","unstructured":"Exibard, L., Filiot, E., Reynier, P.-A.: Synthesis of data word transducers. In: 30th International Conference on Concurrency Theory (CONCUR 2019) (2019)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1090\/S0002-9939-1967-0209086-1","volume":"18","author":"SA Greibach","year":"1967","unstructured":"Greibach, S.A.: A note on pushdown store automata and regular systems. Proc. Am. Math. Soc. 18, 263\u2013268 (1967)","journal-title":"Proc. Am. Math. Soc."},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134, 322\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR22","unstructured":"Khalimov, A., Kupferman, O.: Register-bounded synthesis. In: 30th International Conference on Concurrency Theory (CONCUR 2019) (2019)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-030-01090-4_29","volume-title":"Automated Technology for Verification and Analysis","author":"A Khalimov","year":"2018","unstructured":"Khalimov, A., Maderbacher, B., Bloem, R.: Bounded synthesis of register transducers. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 494\u2013510. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_29"},{"issue":"7","key":"19_CR24","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1016\/j.jcss.2015.03.005","volume":"81","author":"L Libkin","year":"2015","unstructured":"Libkin, L., Tan, T., Vrgo\u010d, D.: Regular expressions for data words. J. Comput. Syst. Sci. 81(7), 1278\u20131297 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular path queries on graphs with data. In: 15th International Conference on Database Theory (ICDT 2012), pp. 74\u201385 (2012)","DOI":"10.1145\/2274576.2274585"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jcss.2017.02.008","volume":"87","author":"AS Murawski","year":"2017","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Reachability in pushdown register automata. J. Comput. Syst. Sci. 87, 58\u201383 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"19_CR27","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: 16th ACM Symposium on Principles of Programming Languages (POPL 1989), pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"19_CR29","unstructured":"Rot, J., de Boer, F., Bonsangue, M.: Pushdown system representation for unbounded object creation, Technical report KIT-13, Karlsruhe Institute of Technology, pp. 38\u201352 (2010)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41\u201357. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11874683_3"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-02508-3_22","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2018","author":"R Senda","year":"2018","unstructured":"Senda, R., Takata, Y., Seki, H.: Complexity results on register context-free grammars and register tree automata. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 415\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02508-3_22"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Senda, R., Takata, Y., Seki, H.: Generalized register context-free grammars. In: 13th International Conference on Language and Automata Theory and Applications (LATA 2019), pp. 259\u2013271 (2019). Revised version: IEICE Trans. Inf. Syst. E103-D(3), 540\u2013548 (2020)","DOI":"10.1587\/transinf.2019FCP0010"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Senda, R., Takata, Y., Seki, H.: Forward regularity preservation property of register pushdown systems. IEICE Trans. Inf. Syst. E104-D(3), 370\u2013380 (2021)","DOI":"10.1587\/transinf.2020FCP0008"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Song, F., Touili, T.: Pushdown model checking for malware detection. TACAS 2012. Extended version. Int. J. Softw. Tools. Tehchnol. Transfer 16, 147\u2013173 (2014)","DOI":"10.1007\/s10009-013-0290-1"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Fresh-register automata. In: 36th ACM Annual Symposium on Principles of Programming Languages (POPL 2009), pp. 295\u2013306 (2009)","DOI":"10.1145\/1925844.1926420"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Walukiewicz, I.: Pushdown processes: games and model-checking. In: 8th International Conference on Computer Aided Verification (CAV 1996), pp. 62\u201374 (1996). Revised version: Inform. Comput. 164, 234\u2013263 (2001)","DOI":"10.1007\/3-540-61474-5_58"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-40184-8_10","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"X Cai","year":"2013","unstructured":"Cai, X., Ogawa, M.: Well-structured pushdown systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 121\u2013136. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40184-8_10"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85315-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:05:59Z","timestamp":1630022759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85315-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030853143","9783030853150"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85315-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2021.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}