{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T20:19:02Z","timestamp":1788553142832,"version":"build-2803163510"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031514814","type":"print"},{"value":"9783031514821","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-51482-1_5","type":"book-chapter","created":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T06:02:47Z","timestamp":1704866567000},"page":"85-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Machine Learning for\u00a0SAST: A Lightweight and\u00a0Adaptable Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9641-220X","authenticated-orcid":false,"given":"Lorenz","family":"H\u00fcther","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6781-4226","authenticated-orcid":false,"given":"Karsten","family":"Sohr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6093-9229","authenticated-orcid":false,"given":"Bernhard J.","family":"Berger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hendrik","family":"Rothe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8435-5025","authenticated-orcid":false,"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,11]]},"reference":[{"key":"5_CR1","unstructured":"Ahmadi, M., Farkhani, R.M., Williams, R., Lu, L.: Finding bugs using your own code: detecting functionally-similar yet inconsistent code. In: 30th USENIX Security Symposium (USENIX Security 2021), pp. 2025\u20132040 (2021)"},{"key":"5_CR2","unstructured":"Alexopoulos, N., Brack, M., Wagner, J.P., Grube, T., M\u00fchlh\u00e4user, M.: How long do vulnerabilities live in the code? A large-scale empirical measurement study on FOSS vulnerability lifetimes. In: 31st USENIX Security Symposium (USENIX Security 2022) (2022)"},{"key":"5_CR3","unstructured":"Arp, D., et al.: Dos and Don\u2019ts of machine learning in computer security. In: 31st USENIX Security Symposium (USENIX Security 2022), pp. 3971\u20133988 (2022)"},{"key":"5_CR4","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 1027\u20131035. Society for Industrial and Applied Mathematics, USA (2007)"},{"key":"5_CR5","volume-title":"Dynamic Programming","author":"R Bellman","year":"1984","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1984)"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Black, P.E.: Juliet 1.3 test suite: changes from 1.2. Technical report, NIST TN 1995, National Institute of Standards and Technology, Gaithersburg, MD (2018). https:\/\/doi.org\/10.6028\/NIST.TN.1995","DOI":"10.6028\/NIST.TN.1995"},{"key":"5_CR7","unstructured":"BSI: Bundesamt f\u00fcr Sicherheit in der Informationstechnik - GitHub Organization. https:\/\/github.com\/BSI-Bund"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1109\/TIFS.2020.3047756","volume":"16","author":"L Cui","year":"2021","unstructured":"Cui, L., Hao, Z., Jiao, Y., Fei, H., Yun, X.: VulDetector: detecting vulnerabilities using weighted feature graph comparison. IEEE Trans. Inf. Forensics Secur. 16, 2004\u20132017 (2021). https:\/\/doi.org\/10.1109\/TIFS.2020.3047756","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Fan, J., Li, Y., Wang, S., Nguyen, T.N.: A C\/C++ code vulnerability dataset with code changes and CVE summaries. In: Proceedings of the 17th International Conference on Mining Software Repositories, MSR 2020, pp. 508\u2013512. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3379597.3387501","DOI":"10.1145\/3379597.3387501"},{"key":"5_CR10","unstructured":"G\u00e9ron, A.: Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow: Concepts, Tools, and Techniques to Build Intelligent Systems, 2nd edn. O\u2019Reilly Media Inc., Beijing (2019)"},{"key":"5_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2022.111537","volume":"195","author":"G Giray","year":"2023","unstructured":"Giray, G., Bennin, K.E., K\u00f6ksal, \u00d6., Babur, \u00d6., Tekinerdogan, B.: On the use of deep learning in software defect prediction. J. Syst. Softw. 195, 111537 (2023). https:\/\/doi.org\/10.1016\/j.jss.2022.111537","journal-title":"J. Syst. Softw."},{"key":"5_CR12","unstructured":"GitHub Inc.: CodeQL. GitHub Inc. (2021)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. ACM SIGPLAN Not. 23(7), 35\u201346 (1988)","DOI":"10.1145\/960116.53994"},{"key":"5_CR14","unstructured":"H\u00fcther, L., et al.: Machine learning in the context of static application security testing - ML-SAST. Technical report, Federal Office for Information Security, Federal Office for Information Security, P.O. Box 20 03 63, 53133 Bonn (2022)"},{"key":"5_CR15","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-981-15-6759-9_9","volume-title":"Deep Learning Applications, Volume 2","author":"JM Johnson","year":"2021","unstructured":"Johnson, J.M., Khoshgoftaar, T.M.: Thresholding strategies for deep learning with highly imbalanced big data. In: Wani, M.A., Khoshgoftaar, T.M., Palade, V. (eds.) Deep Learning Applications, Volume 2. AISC, vol. 1232, pp. 199\u2013227. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-15-6759-9_9"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Landi, W., Ryder, B.G.: Pointer-induced aliasing: a problem classification. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1991, pp. 93\u2013103. Association for Computing Machinery, New York (1991). https:\/\/doi.org\/10.1145\/99583.99599","DOI":"10.1145\/99583.99599"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Li, Z., et al.: VulDeePecker: a deep learning-based system for vulnerability detection. In: Proceedings 2018 Network and Distributed System Security Symposium (2018). https:\/\/doi.org\/10.14722\/ndss.2018.23158","DOI":"10.14722\/ndss.2018.23158"},{"issue":"5","key":"5_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/MSEC.2022.3176058","volume":"20","author":"T Marjanov","year":"2022","unstructured":"Marjanov, T., Pashchenko, I., Massacci, F.: Machine learning for source code vulnerability detection: what works and what isn\u2019t there yet. IEEE Secur. Priv. 20(5), 60\u201376 (2022). https:\/\/doi.org\/10.1109\/MSEC.2022.3176058","journal-title":"IEEE Secur. Priv."},{"key":"5_CR19","unstructured":"McInnes, L., Healy, J., Melville, J.: UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction (2020)"},{"key":"5_CR20","unstructured":"Narayanan, A., Chandramohan, M., Venkatesan, R., Chen, L., Liu, Y., Jaiswal, S.: Graph2vec: Learning Distributed Representations of Graphs (2017)"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Sui, Y., Xue, J.: SVF: interprocedural static value-flow analysis in LLVM. In: Proceedings of the 25th International Conference on Compiler Construction, Barcelona, Spain, pp. 265\u2013266. ACM (2016). https:\/\/doi.org\/10.1145\/2892208.2892235","DOI":"10.1145\/2892208.2892235"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Xia, S., Xiong, Z., Luo, Y., WeiXu, Zhang, G.: Effectiveness of the Euclidean distance in high dimensional spaces. Optik 126(24), 5614\u20135619 (2015). https:\/\/doi.org\/10.1016\/j.ijleo.2015.09.093","DOI":"10.1016\/j.ijleo.2015.09.093"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Yamaguchi, F., Maier, A., Gascon, H., Rieck, K.: Automatic inference of search patterns for taint-style vulnerabilities. In: 2015 IEEE Symposium on Security and Privacy, pp. 797\u2013812 (2015). https:\/\/doi.org\/10.1109\/SP.2015.54","DOI":"10.1109\/SP.2015.54"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-51482-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T06:04:18Z","timestamp":1704866658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-51482-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031514814","9783031514821"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-51482-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Hague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"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":"478","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":"93","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":"19% - 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-4","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":"10","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)"}}]}}