{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:58:36Z","timestamp":1742983116179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030452339"},{"type":"electronic","value":"9783030452346"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45234-6_1","type":"book-chapter","created":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T14:04:23Z","timestamp":1587391463000},"page":"3-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving Symbolic Automata Learning with Concolic Execution"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5190-8957","authenticated-orcid":false,"given":"Donato","family":"Clun","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1801-2996","authenticated-orcid":false,"given":"Phillip","family":"van Heerden","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9646-646X","authenticated-orcid":false,"given":"Antonio","family":"Filieri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0913-3091","authenticated-orcid":false,"given":"Willem","family":"Visser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"issue":"2","key":"1_CR1","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. Information and Computation 75(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Angluin, D.: Queries and Concept Learning. Machine Learning 2(4), 319\u2013342 (apr 1988)","key":"1_CR2","DOI":"10.1007\/BF00116828"},{"doi-asserted-by":"crossref","unstructured":"Argyros, G., D'Antoni, L.: The learnability of symbolic automata. In: Chockler,\nH.,Weissenbacher, G. (eds.) Computer Aided Verification. CAV 2018. pp. 427\u2013445.\nSpringer International Publishing, Cham (2018)","key":"1_CR3","DOI":"10.1007\/978-3-319-96145-3_23"},{"doi-asserted-by":"publisher","unstructured":"Argyros, G., Stais, I., Kiayias, A., Keromytis, A.D.: Back in Black: Towards Formal, Black Box Analysis of Sanitizers and Filters. Proceedings - 2016 IEEE Symposium on Security and Privacy, SP 2016 pp. 91\u2013109 (2016). \nhttps:\/\/doi.org\/10.1109\/SP.2016.14","key":"1_CR4","DOI":"10.1109\/SP.2016.14"},{"doi-asserted-by":"crossref","unstructured":"Aydin, A., Bang, L., Bultan, T.: Automata-Based Model Counting for String Constraints.\nIn: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) Computer Aided Verification. pp.\n255\u2013272. Lecture Notes in Computer Science, Springer International Publishing,\nCham (2015)","key":"1_CR5","DOI":"10.1007\/978-3-319-21690-4_15"},{"unstructured":"Bastani, O., Sharma, R., Aiken, A., Liang, P.: Synthesizing Program Input Grammars. In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation. pp. 95\u2013110. ACM (2017), \nhttp:\/\/arxiv.org\/abs\/1608.01723","key":"1_CR6"},{"doi-asserted-by":"publisher","unstructured":"Cui, W., Peinado, M., Chen, K., Wang, H.J., Irun-Briz, L.: Tupni: Automatic reverse engineering of input formats. Proceedings of the ACM Conference on Computer and Communications Security pp. 391\u2013402 (2008). \nhttps:\/\/doi.org\/10.1145\/1455770.1455820","key":"1_CR7","DOI":"10.1145\/1455770.1455820"},{"unstructured":"D\u2019Antoni, L.: AutomatArk (2018), \nhttps:\/\/github.com\/lorisdanto\/automatark","key":"1_CR8"},{"unstructured":"D\u2019Antoni, L.: SVPAlib (2018), \nhttps:\/\/github.com\/lorisdanto\/symbolicautomata\/","key":"1_CR9"},{"doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M.: The power of symbolic automata and transducers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10426 LNCS, 47\u201367 (2017)","key":"1_CR10","DOI":"10.1007\/978-3-319-63387-9_3"},{"doi-asserted-by":"crossref","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10205 LNCS, 173\u2013189 (2017)","key":"1_CR11","DOI":"10.1007\/978-3-662-54577-5_10"},{"unstructured":"Geldenhuys, J., Visser, W.: Coastal (2019), \nhttps:\/\/github.com\/DeepseaPlatform\/coastal","key":"1_CR12"},{"doi-asserted-by":"publisher","unstructured":"Godefroid, P., Kiezun, A., Levin, M.Y.: Grammar-based whitebox fuzzing. In: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation. pp. 206\u2013215 (2008). \nhttps:\/\/doi.org\/10.1145\/1379022.1375607","key":"1_CR13","DOI":"10.1145\/1379022.1375607"},{"doi-asserted-by":"publisher","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: Dart: Directed automated random testing. In: Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation. p. 213\u2013223. PLDI \u201905, Association for Computing Machinery, New York, NY, USA (2005). \nhttps:\/\/doi.org\/10.1145\/1065010.1065036","key":"1_CR14","DOI":"10.1145\/1065010.1065036"},{"doi-asserted-by":"crossref","unstructured":"Godefroid, P., Peleg, H., Singh, R.: Learn&Fuzz: Machine Learning for Input Fuzzing. In: Proceedings of the 32nd IEEE\/ACM International Conference on Automated Software Engineering. pp. 50\u201359. IEEE Press, Urbana-Champaign, IL, USA (2017)","key":"1_CR15","DOI":"10.1109\/ASE.2017.8115618"},{"unstructured":"Gopinath, R., Mathis, B., H\u00f6schele, M., Kampmann, A., Zeller, A.: Sample-Free Learning of Input Grammars for Comprehensive Software Fuzzing (2018). \nhttp:\/\/arxiv.org\/abs\/1810.08289","key":"1_CR16"},{"doi-asserted-by":"crossref","unstructured":"Heinz, J., Sempere, J.M.: Topics in grammatical inference (2016)","key":"1_CR17","DOI":"10.1007\/978-3-662-48395-4"},{"key":"1_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139194655","volume-title":"Grammatical Inference: Learning Automata and Grammars","author":"C de la Higuera","year":"2010","unstructured":"de la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, New York, NY, USA (2010)"},{"unstructured":"H\u00f6schele, M., Kampmann, A., Zeller, A.: Active Learning of Input Grammars (2017), \nhttp:\/\/arxiv.org\/abs\/1708.08731","key":"1_CR19"},{"unstructured":"Isberner, M.: Foundations of Active Automata Learning: an Algorithmic Perspective. Ph.D. thesis (2015)","key":"1_CR20"},{"doi-asserted-by":"crossref","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) Runtime Verification. pp. 307\u2013322. Springer International Publishing, Cham (2014)","key":"1_CR21","DOI":"10.1007\/978-3-319-11164-3_26"},{"unstructured":"Isberner, M., Steffen, B.: An Abstract Framework for Counterexample Analysis in Active Automata Learning. JMLR: Workshop and Conference Proceedings, 79\u201393 (2014)","key":"1_CR22"},{"doi-asserted-by":"crossref","unstructured":"Kearns, M.J., Vazirani, U.: Learning Finite Automata by Experimentation. In: An Introduction to Computational Learning Theory, pp. 155\u2013158. The MIT Press (1994)","key":"1_CR23","DOI":"10.7551\/mitpress\/3897.001.0001"},{"issue":"5","key":"1_CR24","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/TSE.2009.54","volume":"36","author":"Z Lin","year":"2010","unstructured":"Lin, Z., Zhang, X., Xu, D.: Reverse engineering input syntactic structure from program execution and its applications. IEEE Transactions on Software Engineering 36(5), 688\u2013703 (2010). \nhttps:\/\/doi.org\/10.1109\/TSE.2009.54","journal-title":"IEEE Transactions on Software Engineering"},{"doi-asserted-by":"crossref","unstructured":"Maler, O., Mens, I.E.: Learning Regular Languages over Large Alphabets. In: Abraham,\nE., Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis\nof Systems. TACAS 2014. pp. 485\u2013499. Springer Berlin Heidelberg, Berlin,\nHeidelberg (2014)","key":"1_CR25","DOI":"10.1007\/978-3-642-54862-8_41"},{"doi-asserted-by":"crossref","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: An efficient smt solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 337\u2013340. Springer Berlin Heidelberg, Berlin, Heidelberg (2008)","key":"1_CR26","DOI":"10.1007\/978-3-540-78800-3_24"},{"doi-asserted-by":"publisher","unstructured":"Sen, K., Marinov, D., Agha, G.: Cute: A concolic unit testing engine for c. SIGSOFT Softw. Eng. Notes 30(5), 263\u2013272 (Sep 2005). \nhttps:\/\/doi.org\/10.1145\/1095430.1081750\n\n, \nhttps:\/\/doi.org\/10.1145\/1095430.1081750","key":"1_CR27","DOI":"10.1145\/1095430.1081750 10.1145\/1095430.1081750"},{"doi-asserted-by":"publisher","unstructured":"Veanes, M., De Halleux, P., Tillmann, N.: Rex: Symbolic regular expression explorer. ICST 2010 - 3rd International Conference on Software Testing, Verification and Validation pp. 498\u2013507 (2010). \nhttps:\/\/doi.org\/10.1109\/ICST.2010.15","key":"1_CR28","DOI":"10.1109\/ICST.2010.15"},{"doi-asserted-by":"crossref","unstructured":"Wu, Z., Johnson, E., Bastani, O., Song, D.: REINAM: Reinforcement Learning for Input-Grammar Inference. In: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. pp. 488\u2013498. ACM (2019)","key":"1_CR29","DOI":"10.1145\/3338906.3338958"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45234-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T12:16:55Z","timestamp":1597148215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45234-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452339","9783030452346"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45234-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"81","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":"23","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":"28% - 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":"9","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)"}},{"value":"The conference could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}