{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:04:17Z","timestamp":1780704257006,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032284037","type":"print"},{"value":"9783032284044","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28404-4_15","type":"book-chapter","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:20:29Z","timestamp":1780701629000},"page":"194-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Visibly Recursive Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0298-1349","authenticated-orcid":false,"given":"K\u00e9vin","family":"Dubrulle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9680-9140","authenticated-orcid":false,"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1200-4952","authenticated-orcid":false,"given":"Guillermo A.","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5795-3265","authenticated-orcid":false,"given":"Ga\u00ebtan","family":"Staquet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,6]]},"reference":[{"key":"15_CR1","unstructured":"Alur, R.: Marrying words and trees. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3\u20137, 2007, Proceedings, vol. 4649 of Lecture Notes in Computer Science, pp.\u00a05. Springer, Cham (2007)"},{"issue":"4","key":"15_CR2","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. 27(4), 786\u2013818 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming","author":"R Alur","year":"2005","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for Visibly Pushdown Languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1102\u20131114. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_89"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L., (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13\u201316, 2004, pp. 202\u2013211. ACM (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 16:1\u201316:43 (2009)","DOI":"10.1145\/1516512.1516518"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Berstel, J., Boasson, L.: Balanced grammars and their languages. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002], vol. 2300 of Lecture Notes in Computer Science, pp. 3\u201325. Springer, Cham (2002). https:\/\/doi.org\/10.1007\/3-540-45711-9_1","DOI":"10.1007\/3-540-45711-9_1"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A.W., Winkowski, J., (eds.) CONCUR \u201997: Concurrency Theory, 8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings, vol. 1243 of Lecture Notes in Computer Science, pp. 135\u2013150. Springer, Cham (1997)","DOI":"10.1007\/3-540-63141-0_10"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., P\u00e9rez, G.A. , Staquet, G.: Validating streaming JSON documents with learned VPAs. In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22\u201327, 2023, Proceedings, Part I, vol. 13993 of Lecture Notes in Computer Science, pp. 271\u2013289. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30823-9_14"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Chen, H., Wagner, D.A.: MOPS: an infrastructure for examining security properties of software. In: Atluri, V., (ed.) Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, Washington, DC, USA, November 18\u201322, 2002, pp. 235\u2013244. ACM (2002)","DOI":"10.1145\/586110.586142"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Chiari, M., Mandrioli, D., Pontiggia, F., Pradella, M.: A model checker for operator precedence languages. ACM Trans. Program. Lang. Syst. 45(3), 19:1\u201319:66 (2023)","DOI":"10.1145\/3608443"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-81688-9_18","volume-title":"Computer Aided Verification","author":"M Chiari","year":"2021","unstructured":"Chiari, M., Mandrioli, D., Pradella, M.: Model-Checking Structured Context-Free Languages. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12760, pp. 387\u2013410. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81688-9_18"},{"key":"15_CR13","unstructured":"Dubrulle, K.: Visibly systems of procedural automata validating JSON documents"},{"key":"15_CR14","unstructured":"Dubrulle, K., Bruy\u00e8re, V., P\u00e9rez, G.A., Staquet, G.: Visibly recursive automata. CoRR, abs\/2603.11648 (2026)"},{"key":"15_CR15","unstructured":"Dubrulle, K.: Mutually recursive procedural systems - streaming validation of JSON documents. Master\u2019s thesis, UMONS - Universit\u00e9 de Mons [Facult\u00e9 Polytechnique de Mons], Mons, Belgium (2025)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45500-0_16","volume-title":"Theoretical Aspects of Computer Software","author":"J Esparza","year":"2001","unstructured":"Esparza, J., Ku\u010dera, A., Schwoon, S.: Model-Checking LTL with Regular Valuations for Pushdown Systems. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 316\u2013339. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45500-0_16"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Fortz, S., et al.: A research agenda for active automata learning. Int. J. Softw. Tools Technol. Transfer (2026)","DOI":"10.1007\/s10009-026-00839-z"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Frohme, M., Steffen, B.: Compositional learning of mutually recursive procedural systems. Int. J. Softw. Tools Technol. Transf. 23(4), 521\u2013543 (2021)","DOI":"10.1007\/s10009-021-00634-y"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Gallier, J.H., La\u00a0Torre, S., Mukhopadhyay, S.: Deterministic finite automata with recursive calls and DPDAs. Inf. Process. Lett. 87(4), 187\u2013193 (2003)","DOI":"10.1016\/S0020-0190(03)00281-3"},{"key":"15_CR20","volume-title":"Introduction to Automata Theory","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory. Addison-Wesley, Languages and Computation (1979)"},{"key":"15_CR21","unstructured":"Isberner, M.: Foundations of active automata learning: an algorithmic perspective. PhD thesis, Technical University Dortmund, Germany (2015)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Jia, X., Tan, G.: V-Star: Learning visibly pushdown grammars from program inputs. Proc. ACM Program. Lang. 8(PLDI), 2003\u20132026 (2024)","DOI":"10.1145\/3656458"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: Williamson, C.L., Zurko, M.E., Patel-Schneider, P.F., Shenoy, P.J. (eds), Proceedings of the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8\u201312, 2007, pp. 1053\u20131062. ACM (2007)","DOI":"10.1145\/1242572.1242714"},{"issue":"7","key":"15_CR24","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.ipl.2010.12.013","volume":"111","author":"M Lange","year":"2011","unstructured":"Lange, M.: P-hardness of the emptiness problem for visibly pushdown languages. Inf. Process. Lett. 111(7), 338\u2013341 (2011)","journal-title":"Inf. Process. Lett."},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Le Glaunec, A., Li, A.W., Mamouras, K.: Streaming validation of JSON documents against schemas. Proc. VLDB Endow. 19(3), 509\u2013522 (2025)","DOI":"10.14778\/3778092.3778109"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Nguyen, H.-V., Touili, T.: CARET model checking for pushdown systems. In: Seffah, A., Penzenstadler, B., Alves, C., Peng, X., (eds.) Proceedings of the Symposium on Applied Computing, SAC 2017, Marrakech, Morocco, April 3\u20137, 2017, pp. 1393\u20131400. ACM (2017)","DOI":"10.1145\/3019612.3019829"},{"key":"15_CR27","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company (1997)"},{"issue":"2","key":"15_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10009-013-0290-1","volume":"16","author":"F Song","year":"2014","unstructured":"Song, F., Touili, T.: Pushdown model checking for malware detection. Int. J. Softw. Tools Technol. Transf. 16(2), 147\u2013173 (2014)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"10","key":"15_CR29","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/355598.362773","volume":"13","author":"WA Woods","year":"1970","unstructured":"Woods, W.A.: Transition network grammars for natural language analysis. Commun. ACM 13(10), 591\u2013606 (1970)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28404-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:20:35Z","timestamp":1780701635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28404-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032284037","9783032284044"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28404-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt-ncma-2026.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}