{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:11:44Z","timestamp":1775873504299,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1911017"],"award-info":[{"award-number":["1911017"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014600","name":"MathWorks","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014600","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,12]]},"DOI":"10.1145\/3597503.3639214","type":"proceedings-article","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T16:43:26Z","timestamp":1712940206000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Deterministic Black-box Context-free Grammar Inference"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8357-928X","authenticated-orcid":false,"given":"Mohammad Rifat","family":"Arefin","sequence":"first","affiliation":[{"name":"University of Texas at Arlington, Arlington, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9166-2365","authenticated-orcid":false,"given":"Suraj","family":"Shetiya","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1730-6180","authenticated-orcid":false,"given":"Zili","family":"Wang","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, Iowa, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0896-6902","authenticated-orcid":false,"given":"Christoph","family":"Csallner","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Simulink Model Transformation for Backwards Version Compatibility. In 2021 ACM\/IEEE International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C). IEEE, 427--436","author":"Adhikari Bhisma","year":"2021","unstructured":"Bhisma Adhikari, Eric J Rapos, and Matthew Stephan. 2021. Simulink Model Transformation for Backwards Version Compatibility. In 2021 ACM\/IEEE International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C). IEEE, 427--436."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597926.3598118"},{"key":"e_1_3_2_1_3_1","volume-title":"A note on the number of queries needed to identify regular languages. Information and control 51, 1","author":"Angluin Dana","year":"1981","unstructured":"Dana Angluin. 1981. A note on the number of queries needed to identify regular languages. Information and control 51, 1 (1981), 76--87."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103420"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062349"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523716"},{"key":"e_1_3_2_1_7_1","volume-title":"Can recurrent neural networks learn nested recursion? Linguistic Issues in Language Technology 16","author":"Bernardy Jean-Philippe","year":"2018","unstructured":"Jean-Philippe Bernardy. 2018. Can recurrent neural networks learn nested recursion? Linguistic Issues in Language Technology 16 (2018)."},{"key":"e_1_3_2_1_8_1","volume-title":"Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg","author":"Berstel Jean","unstructured":"Jean Berstel and Luc Boasson. 2002. Balanced grammars and their languages. In Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg. Springer, 3--25."},{"key":"e_1_3_2_1_9_1","volume-title":"USENIX Security Symposium","volume":"19","author":"Blazytko Tim","year":"2019","unstructured":"Tim Blazytko, Cornelius Aschermann, Moritz Schl\u00f6gel, Ali Abbasi, Sergej Schumilo, Simon W\u00f6rner, and Thorsten Holz. 2019. GRIMOIRE: Synthesizing Structure while Fuzzing.. In USENIX Security Symposium, Vol. 19."},{"key":"e_1_3_2_1_10_1","volume-title":"The Algebraic Theory of Context-Free Languages","author":"Chomsky Noam","unstructured":"Noam Chomsky and Marcel Paul Sch\u00fctzenberger. 1963. The Algebraic Theory of Context-Free Languages. In Computer Programming and Formal Systems, P. Braffort and D. Hirshberg (Eds.). North-Holland Publishing, 118--161."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213848"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007353007695"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-9593-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375607"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115618"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3409679"},{"key":"e_1_3_2_1_17_1","unstructured":"James Gosling Bill Joy Guy Steele Gilad Bracha Alex Buckley Daniel Smith and Gavin Bierman. 2022. The Java Language Specification: Java SE 19 Edition. Oracle."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3278186.3278193"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970321"},{"key":"e_1_3_2_1_20_1","first-page":"35","article-title":"Specification and automated detection of code smells using OCL","volume":"7","author":"Kim Tae-Woong","year":"2013","unstructured":"Tae-Woong Kim, Tae-Gong Kim, and Jai-Hyun Seu. 2013. Specification and automated detection of code smells using OCL. International Journal of Software Engineering and Its Applications 7, 4 (2013), 35--44.","journal-title":"International Journal of Software Engineering and Its Applications"},{"key":"e_1_3_2_1_21_1","volume-title":"Technical Report N4917. ISO\/IEC.","author":"Thomas K\u00f6ppe","year":"2022","unstructured":"Thomas K\u00f6ppe et al. 2022. Working Draft, Standard for Programming Language C++. Technical Report N4917. ISO\/IEC."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE51524.2021.9678879"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45164-1_23"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220056"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453101.1453114"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2009.54"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2009.54"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2001.957806"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2017.19"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3416668"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.36"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3330576"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660202"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90017-C"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1709404.1709408"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00014-5"},{"key":"e_1_3_2_1_37_1","volume-title":"Evaluating the ability of LSTMs to learn context-free grammars. arXiv preprint arXiv:1811.02611","author":"Sennhauser Luzi","year":"2018","unstructured":"Luzi Sennhauser and Robert C Berwick. 2018. Evaluating the ability of LSTMs to learn context-free grammars. arXiv preprint arXiv:1811.02611 (2018)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460319.3464814"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2014.05.008"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314589"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338906.3338958"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72016-2_19"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W19-4815"},{"key":"e_1_3_2_1_46_1","volume-title":"Proc. Advances in Neural Information Processing Systems (NIPS). MIT, 43--50","author":"Zuidema Willem H.","year":"2002","unstructured":"Willem H. Zuidema. 2002. How the Poverty of the Stimulus Solves the Poverty of the Stimulus. In Proc. Advances in Neural Information Processing Systems (NIPS). MIT, 43--50. https:\/\/proceedings.neurips.cc\/paper\/2002\/hash\/04ad5632029cbfbed8e136e5f6f7ddfa-Abstract.html"}],"event":{"name":"ICSE '24: IEEE\/ACM 46th International Conference on Software Engineering","location":"Lisbon Portugal","acronym":"ICSE '24","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS","Faculty of Engineering of University of Porto"]},"container-title":["Proceedings of the IEEE\/ACM 46th International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597503.3639214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597503.3639214","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597503.3639214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:49:13Z","timestamp":1750286953000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597503.3639214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,12]]},"references-count":45,"alternative-id":["10.1145\/3597503.3639214","10.1145\/3597503"],"URL":"https:\/\/doi.org\/10.1145\/3597503.3639214","relation":{},"subject":[],"published":{"date-parts":[[2024,4,12]]},"assertion":[{"value":"2024-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}