{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:13:11Z","timestamp":1743009191553,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031160103"},{"type":"electronic","value":"9783031160110"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-16011-0_10","type":"book-chapter","created":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T07:03:42Z","timestamp":1665731022000},"page":"138-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Refinement Based Algorithm for\u00a0Learning Program Input Grammars"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6238-6293","authenticated-orcid":false,"given":"Hannes","family":"Sochor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2278-8233","authenticated-orcid":false,"given":"Flavio","family":"Ferrarotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,15]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Bastani, O., Sharma, R., Aiken, A., Liang, P.: Synthesizing program input grammars. In: Cohen, A., Vechev, M.T. (eds.) Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, pp. 95\u2013110. ACM (2017). https:\/\/doi.org\/10.1145\/3062341.3062349","DOI":"10.1145\/3062341.3062349"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-030-59762-7_8","volume-title":"Search-Based Software Engineering","author":"M Eberlein","year":"2020","unstructured":"Eberlein, M., Noller, Y., Vogel, T., Grunske, L.: Evolutionary grammar-based fuzzing. In: Aleti, A., Panichella, A. (eds.) SSBSE 2020. LNCS, vol. 12420, pp. 105\u2013120. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59762-7_8"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Godefroid, P., Kiezun, A., Levin, M.Y.: Grammar-based whitebox fuzzing. In: SIGPLAN Not, vol. 43, pp. 206\u2013215, June 2008. https:\/\/doi.org\/10.1145\/1379022.1375607","DOI":"10.1145\/1379022.1375607"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967). https:\/\/doi.org\/10.1016\/S0019-9958(67)91165-5","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"10_CR6","unstructured":"Gopinath, R., Mathis, B., Zeller, A.: Inferring input grammars from dynamic control flow. CoRR abs\/1912.05937 (2019). arxiv.org\/abs\/1912.05937"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"De la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, New York (2010)","DOI":"10.1017\/CBO9781139194655"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Hodov\u00e1n, R., Kiss, A., Gyim\u00f3thy, T.: Grammarinator: a grammar-based open source fuzzer. In: Proceedings of the 9th ACM SIGSOFT International Workshop on Automating TEST Case Design, Selection, and Evaluation, pp. 45\u201348. A-TEST 2018, Association for Computing Machinery, New York, NY, USA (2018). DOIurl10.1145\/3278186.3278193","DOI":"10.1145\/3278186.3278193"},{"key":"10_CR9","volume-title":"Introduction to Automata Theory. Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory. Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"H\u00f6schele, M., Zeller, A.: Mining input grammars from dynamic taints. In: Lo, D., Apel, S., Khurshid, S. (eds.) Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering, ASE 2016, pp. 720\u2013725. ACM (2016). https:\/\/doi.org\/10.1145\/2970276.2970321","DOI":"10.1145\/2970276.2970321"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"H\u00f6schele, M., Zeller, A.: Mining input grammars with AUTOGRAM. In: Uchitel, S., Orso, A., Robillard, M.P. (eds.) Proceedings of the 39th International Conference on Software Engineering, ICSE 2017, pp. 31\u201334. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ICSE-C.2017.14","DOI":"10.1109\/ICSE-C.2017.14"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Le, X.B.D., Pasareanu, C., Padhye, R., Lo, D., Visser, W., Sen, K.: Saffron: adaptive grammar-based fuzzing for worst-case analysis. SIGSOFT Softw. Eng. Notes 44(4), 14 (2021). https:\/\/doi.org\/10.1145\/3364452.3364455","DOI":"10.1145\/3364452.3364455"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Moser, M., Pichler, J.: eKnows: platform for multi-language reverse engineering and documentation generation. In: IEEE International Conference on Software Maintenance and Evolution, ICSME 2021, pp. 559\u2013568. IEEE (2021). https:\/\/doi.org\/10.1109\/ICSME52107.2021.00057","DOI":"10.1109\/ICSME52107.2021.00057"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Oncina, J., Garc\u00eda, P.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic Pattern Recognition, pp. 99\u2013108 (1992). https:\/\/doi.org\/10.1142\/9789812797919_0007","DOI":"10.1142\/9789812797919_0007"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Romero, J.: Pyformlang: an educational library for formal language manipulation. In: Sherriff, M., Merkle, L.D., Cutter, P.A., Monge, A.E., Sheard, J. (eds.) SIGCSE 2021: The 52nd ACM Technical Symposium on Computer Science Education, pp. 576\u2013582. ACM (2021). https:\/\/doi.org\/10.1145\/3408877.3432464","DOI":"10.1145\/3408877.3432464"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Wu, Z., et al.: REINAM: reinforcement learning for input-grammar inference. In: Dumas, M., Pfahl, D., Apel, S., Russo, A. (eds.) Proceedings of the ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/SIGSOFT FSE 2019, pp. 488\u2013498. ACM (2019). https:\/\/doi.org\/10.1145\/3338906.3338958","DOI":"10.1145\/3338906.3338958"}],"container-title":["Lecture Notes in Computer Science","From Data to Models and Back"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16011-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T07:05:07Z","timestamp":1665731107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16011-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031160103","9783031160110"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16011-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DataMod","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium: From Data to Models and Back","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 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"datamod2021","order":10,"name":"conference_id","label":"Conference ID","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":"12","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":"9","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":"1","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":"75% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}