{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:10:11Z","timestamp":1765545011580,"version":"3.41.2"},"reference-count":83,"publisher":"Association for Computing Machinery (ACM)","issue":"ISSTA","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276284, 61976232, 61876204, 51978675"],"award-info":[{"award-number":["62276284, 61976232, 61876204, 51978675"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2023A1515011470, 2025A1515011639"],"award-info":[{"award-number":["2023A1515011470, 2025A1515011639"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shenzhen Science and Technology Program","award":["KJZD2023092311405902"],"award-info":[{"award-number":["KJZD2023092311405902"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Softw. Eng."],"published-print":{"date-parts":[[2025,6,22]]},"abstract":"<jats:p>It is hard to mine high-quality finite-state automata (FSAs) only from desired software behaviors, i.e., positive examples, because of a search space explosion and an overgeneralization problem induced by a lack of undesired software behaviors, i.e., negative examples. To tackle the overgeneralization problem, we suggest modeling the problem as searching for approximate FSAs from positive and negative examples with noise, where the noise originates from synthetic negative examples used to reject overgeneralized results. To obtain an effective search bias in the exploding search space, we bridge FSA acceptance to neural network inference. Our key contribution is to design a neural network whose parameter assignment corresponds to an FSA, and its neural inference process, named after neural acceptance, is able to simulate FSA acceptance. The neural acceptance provides a way to quantify how well an FSA fits noisy data efficiently. We propose NADA, a neural acceptance-driven approach, to search for approximate FSAs guided by accepting positive examples and rejecting synthetic negative examples. NADA is based on a proper continuous relaxation of the discrete search space of FSAs and an efficient gradient descent-based search algorithm. Experimental results demonstrate that, compared with state-of-the-art approaches, NADA significantly improves the quality of mined FSAs (on average improves 41.63% F1 score). Besides, NADA is 19.8X faster than the approach mining sub-high-quality FSAs.<\/jats:p>","DOI":"10.1145\/3728956","type":"journal-article","created":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T10:52:56Z","timestamp":1750589576000},"page":"1795-1817","source":"Crossref","is-referenced-by-count":1,"title":["NADA: Neural Acceptance-Driven Approximate Specification Mining"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3733-9361","authenticated-orcid":false,"given":"Weilin","family":"Luo","sequence":"first","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7926-5956","authenticated-orcid":false,"given":"Tingchen","family":"Han","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8315-9337","authenticated-orcid":false,"given":"Junming","family":"Qiu","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5357-9130","authenticated-orcid":false,"given":"Hai","family":"Wan","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-1387","authenticated-orcid":false,"given":"Jianfeng","family":"Du","sequence":"additional","affiliation":[{"name":"Guangdong University of Foreign Studies, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3468-9507","authenticated-orcid":false,"given":"Bo","family":"Peng","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5115-4769","authenticated-orcid":false,"given":"Guohui","family":"Xiao","sequence":"additional","affiliation":[{"name":"Southeast University, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7357-1793","authenticated-orcid":false,"given":"Yanan","family":"Liu","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Hen Amar Lingfeng Bao Nimrod Busany David Lo and Shahar Maoz. 2018. Using finite-state models for log differencing. In FSE. 49\u201359. https:\/\/doi.org\/10.1145\/3236024.3236069 10.1145\/3236024.3236069","DOI":"10.1145\/3236024.3236069"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503275"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"e_1_2_1_4_1","unstructured":"Dana Angluin Sarah Eisenstat and Dana Fisman. 2015. Learning Regular Languages via Alternating Automata. In IJCAI. 3308\u20133314."},{"key":"e_1_2_1_5_1","first-page":"17","article-title":"Inferring DFA without Negative Examples","volume":"93","author":"Avellaneda Florent","year":"2018","unstructured":"Florent Avellaneda and Alexandre Petrenko. 2018. Inferring DFA without Negative Examples. In ICGI. 93, 17\u201329.","journal-title":"ICGI."},{"key":"e_1_2_1_6_1","first-page":"81","article-title":"Explaining Black Boxes on Sequential Data using Weighted Automata","volume":"93","author":"Ayache St\u00e9phane","year":"2018","unstructured":"St\u00e9phane Ayache, R\u00e9mi Eyraud, and No\u00e9 Goudian. 2018. Explaining Black Boxes on Sequential Data using Weighted Automata. In ICGI. 93, 81\u2013103.","journal-title":"ICGI."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Lingfeng Bao Nimrod Busany David Lo and Shahar Maoz. 2019. Statistical Log Differencing. In ASE. 851\u2013862. https:\/\/doi.org\/10.1109\/ASE.2019.00084 10.1109\/ASE.2019.00084","DOI":"10.1109\/ASE.2019.00084"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77395-5_11"},{"key":"e_1_2_1_9_1","volume-title":"Statistical inference for probabilistic functions of finite state Markov chains. The annals of mathematical statistics, 37, 6","author":"Baum Leonard E","year":"1966","unstructured":"Leonard E Baum and Ted Petrie. 1966. Statistical inference for probabilistic functions of finite state Markov chains. The annals of mathematical statistics, 37, 6 (1966), 1554\u20131563."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2014.2369047"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025151"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5009015"},{"key":"e_1_2_1_13_1","unstructured":"Jonathon Cai Richard Shin and Dawn Song. 2017. Making Neural Programming Architectures Generalize via Recursion. In ICLR. OpenReview.net."},{"key":"e_1_2_1_14_1","volume-title":"McIlraith","author":"Camacho Alberto","year":"2019","unstructured":"Alberto Camacho and Sheila A. McIlraith. 2019. Learning Interpretable Models Expressed in Linear Temporal Logic. In ICAPS. 621\u2013630."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58150-3_15"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCCC.2003.1245447"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Valentin Dallmeier Nikolai Knopp Christoph Mallon Sebastian Hack and Andreas Zeller. 2010. Generating test cases for specification mining. In ISSTA. 85\u201396. https:\/\/doi.org\/10.1145\/1831708.1831719 10.1145\/1831708.1831719","DOI":"10.1145\/1831708.1831719"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138912.1138918"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.98"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/302405.302672"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88885-5_6"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/S10009-019-00544-0"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90562-4"},{"key":"e_1_2_1_25_1","volume-title":"Neural network for synthesizing deterministic finite automata. Procedia computer science, 119","author":"Grachev Petr","year":"2017","unstructured":"Petr Grachev, Igor Lobanov, Ivan Smetannikov, and Andrey Filchenkov. 2017. Neural network for synthesizing deterministic finite automata. Procedia computer science, 119 (2017), 73\u201382."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15488-1_7"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1162\/0899766053630350"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3424307"},{"key":"e_1_2_1_29_1","volume-title":"Fool\u2019s Gold: Extracting Finite State Machines from Recurrent Network Dynamics. In NeurIPS. Morgan Kaufmann, 501\u2013508.","author":"Kolen John F.","year":"1993","unstructured":"John F. Kolen. 1993. Fool\u2019s Gold: Extracting Finite State Machines from Recurrent Network Dynamics. In NeurIPS. Morgan Kaufmann, 501\u2013508."},{"key":"e_1_2_1_30_1","unstructured":"Anurag Koul Alan Fern and Sam Greydanus. 2019. Learning Finite State Representations of Recurrent Policy Networks. In ICLR."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Ivo Krka Yuriy Brun and Nenad Medvidovic. 2014. Automatic mining of specifications from invocation traces and method invariants. In FSE. 178\u2013189. https:\/\/doi.org\/10.1145\/2635868.2635890 10.1145\/2635868.2635890","DOI":"10.1145\/2635868.2635890"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Kevin J. Lang. 1992. Random DFA\u2019s Can Be Approximately Learned from Sparse Uniform Examples. In COLT. 45\u201352. https:\/\/doi.org\/10.1145\/130385.130390 10.1145\/130385.130390","DOI":"10.1145\/130385.130390"},{"key":"e_1_2_1_33_1","unstructured":"Kevin J Lang. 1999. Faster algorithms for finding minimal consistent DFAs. NEC Research Institute Tech. Rep."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFB0054059"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.83"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213876"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","unstructured":"Caroline Lemieux Dennis Park and Ivan Beschastnikh. 2015. General LTL Specification Mining (T). In ASE. 81\u201392. https:\/\/doi.org\/10.1109\/ASE.2015.71 10.1109\/ASE.2015.71","DOI":"10.1109\/ASE.2015.71"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2006.47"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","unstructured":"David Lo and Siau-Cheng Khoo. 2006. SMArTIC: towards building an accurate robust and scalable specification miner. In FSE. 265\u2013275. https:\/\/doi.org\/10.1145\/1181775.1181808 10.1145\/1181775.1181808","DOI":"10.1145\/1181775.1181808"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","unstructured":"David Lo Leonardo Mariani and Mauro Pezz\u00e8. 2009. Automatic steering of behavioral model inference. In FSE. 345\u2013354. https:\/\/doi.org\/10.1145\/1595696.1595761 10.1145\/1595696.1595761","DOI":"10.1145\/1595696.1595761"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","unstructured":"Davide Lorenzoli Leonardo Mariani and Mauro Pezz\u00e8. 2008. Automatic generation of software behavioral models. In ICSE. 501\u2013510. https:\/\/doi.org\/10.1145\/1368088.1368157 10.1145\/1368088.1368157","DOI":"10.1145\/1368088.1368157"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","unstructured":"Weilin Luo Pingjia Liang Jianfeng Du Hai Wan Bo Peng and Delong Zhang. 2022. Bridging LTLf Inference to GNN Inference for Learning LTLf Formulae. In AAAI. 9849\u20139857. https:\/\/doi.org\/10.1609\/AAAI.V36I9.21221 10.1609\/AAAI.V36I9.21221","DOI":"10.1609\/AAAI.V36I9.21221"},{"key":"e_1_2_1_43_1","unstructured":"Mingjun Ma Dehui Du Yuanhao Liu Yanyun Wang and Yiyang Li. 2022. Efficient Adversarial Sequence Generation for RNN with Symbolic Weighted Finite Automata. In AAAI. 3087."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.93"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39277-1_3"},{"key":"e_1_2_1_46_1","volume-title":"Patel","author":"Michalenko Joshua J.","year":"2019","unstructured":"Joshua J. Michalenko, Ameesh Shah, Abhinav Verma, Richard G. Baraniuk, Swarat Chaudhuri, and Ankit B. Patel. 2019. Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks. In ICLR."},{"key":"e_1_2_1_47_1","unstructured":"Alexander Mordvintsev. 2022. Differentiable Finite State Machines. https:\/\/google-research.github.io\/self-organising-systems\/2022\/diff-fsm\/"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","unstructured":"Sarah Nadi Stefan Kr\u00fcger Mira Mezini and Eric Bodden. 2016. Jumping through hoops: why do Java developers struggle with cryptography APIs? In ICSE. 935\u2013946. https:\/\/doi.org\/10.1145\/2884781.2884790 10.1145\/2884781.2884790","DOI":"10.1145\/2884781.2884790"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","unstructured":"Daniel Neider and Ivan Gavran. 2018. Learning Linear Temporal Properties. In FMCAD. 1\u201310. https:\/\/doi.org\/10.23919\/FMCAD.2018.8603016 10.23919\/FMCAD.2018.8603016","DOI":"10.23919\/FMCAD.2018.8603016"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","unstructured":"Takamasa Okudono Masaki Waga Taro Sekiyama and Ichiro Hasuo. 2020. Weighted Automata Extraction from Recurrent Neural Networks via Regression on State Spaces. In AAAI. 5306\u20135314. https:\/\/doi.org\/10.1609\/AAAI.V34I04.5977 10.1609\/AAAI.V34I04.5977","DOI":"10.1609\/AAAI.V34I04.5977"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010828029885"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(95)00086-0"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.485647"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1996.549038"},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 Oncina and Pedro Garcia. 1992. Identifying regular languages in polynomial time. In Advances in structural and syntactic pattern recognition. 99\u2013108.","DOI":"10.1142\/9789812797919_0007"},{"key":"e_1_2_1_56_1","volume-title":"Inferring regular languages in polynomial update time. Pattern recognition and image analysis, 1, 49-61","author":"Oncina Jos\u00e9","year":"1992","unstructured":"Jos\u00e9 Oncina and Pedro Garcia. 1992. Inferring regular languages in polynomial update time. Pattern recognition and image analysis, 1, 49-61 (1992), 10\u20131142."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138042"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","unstructured":"Amir Pnueli. 1977. The Temporal Logic of Programs. In FOCS. 46\u201357. https:\/\/doi.org\/10.1109\/SFCS.1977.32 10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","unstructured":"Rajarshi Roy Jean-Rapha\u00ebl Gaglione Nasim Baharisangari Daniel Neider Zhe Xu and Ufuk Topcu. 2023. Learning Interpretable Temporal Properties from Positive Examples Only. In AAAI. 6507\u20136515. https:\/\/doi.org\/10.1609\/AAAI.V37I5.25800 10.1609\/AAAI.V37I5.25800","DOI":"10.1609\/AAAI.V37I5.25800"},{"key":"e_1_2_1_60_1","doi-asserted-by":"crossref","unstructured":"Ingo Schellhammer Joachim Diederich Michael Towsey and Claudia Brugman. 1998. Knowledge Extraction and Recurrent Neural Networks: An Analysis of an Elman Network trained on a Natural Language Learning Task. In NeMLaP\/CoNLL. 73\u201378.","DOI":"10.3115\/1603899.1603912"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503914"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1609\/AAAI.V35I11.17161"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77313-1_14"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.INS.2023.120034"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2019.8668025"},{"key":"e_1_2_1_66_1","first-page":"202","article-title":"Query Learning Algorithm for Symbolic Weighted Finite Automata","volume":"153","author":"Suzuki Kaito","year":"2021","unstructured":"Kaito Suzuki, Diptarama Hendrian, Ryo Yoshinaka, and Ayumi Shinohara. 2021. Query Learning Algorithm for Symbolic Weighted Finite Automata. In ICGI. 153, 202\u2013216.","journal-title":"ICGI."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","unstructured":"Anej Svete Robin Chan and Ryan Cotterell. 2024. On Efficiently Representing Regular Languages as RNNs. In Findings of ACL. 4118\u20134135. https:\/\/doi.org\/10.18653\/V1\/2024.FINDINGS-ACL.244 10.18653\/V1\/2024.FINDINGS-ACL.244","DOI":"10.18653\/V1\/2024.FINDINGS-ACL.244"},{"volume-title":"Finite automata: Behavior and synthesis","author":"Trakhtenbrot Boris Avraamovich","key":"e_1_2_1_68_1","unstructured":"Boris Avraamovich Trakhtenbrot and Ya M Barzdin. 1973. Finite automata: Behavior and synthesis. Elsevier."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15579-1_48"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-65633-0_10"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","unstructured":"Neil Walkinshaw and Kirill Bogdanov. 2008. Inferring Finite-State Models with Temporal Constraints. In ASE. 248\u2013257. https:\/\/doi.org\/10.1109\/ASE.2008.35 10.1109\/ASE.2008.35","DOI":"10.1109\/ASE.2008.35"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","unstructured":"Hai Wan Pingjia Liang Jianfeng Du Weilin Luo Rongzhen Ye and Bo Peng. 2024. End-to-End Learning of LTLf Formulae by Faithful LTLf Encoding. In AAAI. 9071\u20139079. https:\/\/doi.org\/10.1609\/AAAI.V38I8.28757 10.1609\/AAAI.V38I8.28757","DOI":"10.1609\/AAAI.V38I8.28757"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_A_01111"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323820"},{"key":"e_1_2_1_75_1","unstructured":"Zhuo Wang Wei Zhang Ning Liu and Jianyong Wang. 2021. Scalable Rule-Based Representation Learning for Interpretable Classification. In NeurIPS. 30479\u201330491."},{"key":"e_1_2_1_76_1","first-page":"5244","article-title":"Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples","volume":"80","author":"Weiss Gail","year":"2018","unstructured":"Gail Weiss, Yoav Goldberg, and Eran Yahav. 2018. Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples. In ICML. 80, 5244\u20135253.","journal-title":"ICML."},{"key":"e_1_2_1_77_1","volume-title":"Learning Deterministic Weighted Automata with Queries and Counterexamples. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019","author":"Weiss Gail","year":"2019","unstructured":"Gail Weiss, Yoav Goldberg, and Eran Yahav. 2019. Learning Deterministic Weighted Automata with Queries and Counterexamples. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada. 8558\u20138569."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1007\/S10994-022-06163-2"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","unstructured":"Yinxing Xue Junjie Wang Yang Liu Hao Xiao Jun Sun and Mahinthan Chandramohan. 2015. Detection and classification of malicious JavaScript via attack behavior modelling. In ISSTA. 48\u201359. https:\/\/doi.org\/10.1145\/2771783.2771814 10.1145\/2771783.2771814","DOI":"10.1145\/2771783.2771814"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","unstructured":"Jinlin Yang David Evans Deepali Bhardwaj Thirumalesh Bhat and Manuvir Das. 2006. Perracotta: mining temporal API rules from imperfect traces. In ICSE. 282\u2013291. https:\/\/doi.org\/10.1145\/1134285.1134325 10.1145\/1134285.1134325","DOI":"10.1145\/1134285.1134325"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3675394"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-13435-8_12"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","unstructured":"Xiyue Zhang Xiaoning Du Xiaofei Xie Lei Ma Yang Liu and Meng Sun. 2021. Decision-Guided Weighted Automata Extraction from Recurrent Neural Networks. In AAAI. 11699\u201311707. https:\/\/doi.org\/10.1609\/AAAI.V35I13.17391 10.1609\/AAAI.V35I13.17391","DOI":"10.1609\/AAAI.V35I13.17391"}],"container-title":["Proceedings of the ACM on Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3728956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:48:51Z","timestamp":1752684531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":83,"journal-issue":{"issue":"ISSTA","published-print":{"date-parts":[[2025,6,22]]}},"alternative-id":["10.1145\/3728956"],"URL":"https:\/\/doi.org\/10.1145\/3728956","relation":{},"ISSN":["2994-970X"],"issn-type":[{"type":"electronic","value":"2994-970X"}],"subject":[],"published":{"date-parts":[[2025,6,22]]}}}