{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T02:52:53Z","timestamp":1771210373793,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T00:00:00Z","timestamp":1619395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,26]]},"DOI":"10.1145\/3422337.3447848","type":"proceedings-article","created":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T07:57:52Z","timestamp":1618041472000},"page":"281-292","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["SE-PAC"],"prefix":"10.1145","author":[{"given":"Lamine","family":"Noureddine","sequence":"first","affiliation":[{"name":"Univ. Rennes, Inria, IRISA, Rennes, France"}]},{"given":"Annelie","family":"Heuser","sequence":"additional","affiliation":[{"name":"Univ. Rennes, Inria, CNRS, IRISA, Rennes, France"}]},{"given":"Cassius","family":"Puodzius","sequence":"additional","affiliation":[{"name":"Univ. Rennes, Inria, IRISA, Rennes, France"}]},{"given":"Olivier","family":"Zendra","sequence":"additional","affiliation":[{"name":"Univ. Rennes, Inria, IRISA, Rennes, France"}]}],"member":"320","published-online":{"date-parts":[[2021,4,26]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"BITDEFENDER ANTIVIRUS TECHNOLOGY. White paper. https:\/\/www. bitdefender.com\/files\/Main\/file\/BitDefender_Antivirus_Technology.pdf Access","year":"2020","unstructured":"2007. BITDEFENDER ANTIVIRUS TECHNOLOGY. White paper. https:\/\/www. bitdefender.com\/files\/Main\/file\/BitDefender_Antivirus_Technology.pdf Access : Oct. 2020 . 2007. BITDEFENDER ANTIVIRUS TECHNOLOGY. White paper. https:\/\/www. bitdefender.com\/files\/Main\/file\/BitDefender_Antivirus_Technology.pdf Access: Oct. 2020."},{"key":"e_1_3_2_2_2_1","volume-title":"https:\/\/github.com\/qy7tt\/petoy. Access","author":"Toy PE","year":"2020","unstructured":"2016. PE Toy . https:\/\/github.com\/qy7tt\/petoy. Access : Oct. 2020 . 2016. PE Toy. https:\/\/github.com\/qy7tt\/petoy. Access: Oct. 2020."},{"key":"e_1_3_2_2_3_1","volume-title":"https:\/\/github.com\/SamLarenN\/PePacker. Access","year":"2020","unstructured":"2017. PePacker. https:\/\/github.com\/SamLarenN\/PePacker. Access : Oct. 2020 . 2017. PePacker. https:\/\/github.com\/SamLarenN\/PePacker. Access: Oct. 2020."},{"key":"e_1_3_2_2_4_1","volume-title":"https:\/\/github.com\/EgeBalci\/Amber. Access","year":"2020","unstructured":"2018. Amber. https:\/\/github.com\/EgeBalci\/Amber. Access : Oct. 2020 . 2018. Amber. https:\/\/github.com\/EgeBalci\/Amber. Access: Oct. 2020."},{"key":"e_1_3_2_2_5_1","volume-title":"https:\/\/github.com\/z3r0d4y5\/Simple-PE32-Packer. Access","year":"2020","unstructured":"2018. Simple-PE32-Packer. https:\/\/github.com\/z3r0d4y5\/Simple-PE32-Packer. Access : Oct. 2020 . 2018. Simple-PE32-Packer. https:\/\/github.com\/z3r0d4y5\/Simple-PE32-Packer. Access: Oct. 2020."},{"key":"e_1_3_2_2_6_1","volume-title":"theArk. https:\/\/github.com\/aaaddress1\/theArk. Access","year":"2020","unstructured":"2019. theArk. https:\/\/github.com\/aaaddress1\/theArk. Access : Oct. 2020 . 2019. theArk. https:\/\/github.com\/aaaddress1\/theArk. Access: Oct. 2020."},{"key":"e_1_3_2_2_7_1","volume-title":"Writing a simple PE Packer in detail. https:\/\/github.com\/levanvn\/Packer_ Simple-1. Access","year":"2020","unstructured":"2019. Writing a simple PE Packer in detail. https:\/\/github.com\/levanvn\/Packer_ Simple-1. Access : Oct. 2020 . 2019. Writing a simple PE Packer in detail. https:\/\/github.com\/levanvn\/Packer_ Simple-1. Access: Oct. 2020."},{"key":"e_1_3_2_2_8_1","volume-title":"https:\/\/github.com\/horsicq\/Detect-It-Easy. Access","year":"2020","unstructured":"2020. Detect-It-Easy. https:\/\/github.com\/horsicq\/Detect-It-Easy. Access : Oct. 2020 . 2020. Detect-It-Easy. https:\/\/github.com\/horsicq\/Detect-It-Easy. Access: Oct. 2020."},{"key":"e_1_3_2_2_9_1","volume-title":"https:\/\/github.com\/dr4k0nia\/Origami. Access","year":"2020","unstructured":"2020. Origami. https:\/\/github.com\/dr4k0nia\/Origami. Access : Oct. 2020 . 2020. Origami. https:\/\/github.com\/dr4k0nia\/Origami. Access: Oct. 2020."},{"key":"e_1_3_2_2_10_1","volume-title":"https:\/\/github.com\/czs108\/PE-Packer. Access","year":"2020","unstructured":"2020. PE-Packer. https:\/\/github.com\/czs108\/PE-Packer. Access : Oct. 2020 . 2020. PE-Packer. https:\/\/github.com\/czs108\/PE-Packer. Access: Oct. 2020."},{"key":"e_1_3_2_2_11_1","volume-title":"https:\/\/github.com\/avast-tl\/pelib. Access","year":"2020","unstructured":"2020. PeLib. https:\/\/github.com\/avast-tl\/pelib. Access : Oct. 2020 . 2020. PeLib. https:\/\/github.com\/avast-tl\/pelib. Access: Oct. 2020."},{"key":"e_1_3_2_2_12_1","volume-title":"https:\/\/rada.re\/n\/. Access","year":"2020","unstructured":"2020. Radare2. https:\/\/rada.re\/n\/. Access : Oct. 2020 . 2020. Radare2. https:\/\/rada.re\/n\/. Access: Oct. 2020."},{"key":"e_1_3_2_2_13_1","volume-title":"scikit-learn: Machine Learning in Python. https:\/\/scikit-learn.org\/. Access","year":"2020","unstructured":"2020. scikit-learn: Machine Learning in Python. https:\/\/scikit-learn.org\/. Access : Oct. 2020 . 2020. scikit-learn: Machine Learning in Python. https:\/\/scikit-learn.org\/. Access: Oct. 2020."},{"key":"e_1_3_2_2_14_1","volume-title":"https:\/\/github.com\/SilentVoid13\/Silent_Packer. Access","year":"2020","unstructured":"2020. Silent-Packer. https:\/\/github.com\/SilentVoid13\/Silent_Packer. Access : Oct. 2020 . 2020. Silent-Packer. https:\/\/github.com\/SilentVoid13\/Silent_Packer. Access: Oct. 2020."},{"key":"e_1_3_2_2_15_1","volume-title":"xorPacker. https:\/\/github.com\/nqntmqmqmb\/xorPacker. Access","year":"2020","unstructured":"2020. xorPacker. https:\/\/github.com\/nqntmqmqmb\/xorPacker. Access : Oct. 2020 . 2020. xorPacker. https:\/\/github.com\/nqntmqmqmb\/xorPacker. Access: Oct. 2020."},{"key":"e_1_3_2_2_16_1","volume-title":"https:\/\/github.com\/VirusTotal\/yara. Access","author":"YARA.","year":"2020","unstructured":"2020. YARA. https:\/\/github.com\/VirusTotal\/yara. Access : Oct. 2020 . 2020. YARA. https:\/\/github.com\/VirusTotal\/yara. Access: Oct. 2020."},{"key":"e_1_3_2_2_17_1","unstructured":"Margareta Ackerman and Sanjoy Dasgupta. 2014. Incremental clustering: The case for extra clusters. In Advances in Neural Information Processing Systems. 307--315.  Margareta Ackerman and Sanjoy Dasgupta. 2014. Incremental clustering: The case for extra clusters. In Advances in Neural Information Processing Systems. 307--315."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-016-0330-4"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2019.05.007"},{"key":"e_1_3_2_2_20_1","volume-title":"A comparison of p-dispersion heuristics. Computers & operations research 21, 10","author":"Erkut Erhan","year":"1994","unstructured":"Erhan Erkut , Yilmaz \u00dclk\u00fcsal , and Oktay Yenicerio\u011flu . 1994. A comparison of p-dispersion heuristics. Computers & operations research 21, 10 ( 1994 ), 1103--1113. Erhan Erkut, Yilmaz \u00dclk\u00fcsal, and Oktay Yenicerio\u011flu. 1994. A comparison of p-dispersion heuristics. Computers & operations research 21, 10 (1994), 1103--1113."},{"key":"e_1_3_2_2_21_1","first-page":"226","article-title":"A densitybased algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans-Peter Kriegel , J\u00f6rg Sander , Xiaowei Xu , 1996 . A densitybased algorithm for discovering clusters in large spatial databases with noise .. In Kdd , Vol. 96. 226 -- 231 . Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, Xiaowei Xu, et al. 1996. A densitybased algorithm for discovering clusters in large spatial databases with noise.. In Kdd, Vol. 96. 226--231.","journal-title":"Kdd"},{"key":"e_1_3_2_2_22_1","volume-title":"A general coefficient of similarity and some of its properties. Biometrics","author":"Gower John C","year":"1971","unstructured":"John C Gower . 1971. A general coefficient of similarity and some of its properties. Biometrics ( 1971 ), 857--871. John C Gower. 1971. A general coefficient of similarity and some of its properties. Biometrics (1971), 857--871."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3151137.3160687"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11416-015-0249-8"},{"key":"e_1_3_2_2_25_1","volume-title":"Peter KK Loh, and Freddy Tan","author":"Li Xufang","year":"2011","unstructured":"Xufang Li , Peter KK Loh, and Freddy Tan . 2011 . Mechanisms of polymorphic and metamorphic viruses. In 2011 European intelligence and security informatics conference. IEEE , 149--154. Xufang Li, Peter KK Loh, and Freddy Tan. 2011. Mechanisms of polymorphic and metamorphic viruses. In 2011 European intelligence and security informatics conference. IEEE, 149--154."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2910268"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2007.15"},{"key":"e_1_3_2_2_28_1","volume-title":"Global Ransomware Damage Costs Predicted To Reach $20 Billion (USD) By","author":"Morgan Steve","year":"2021","unstructured":"Steve Morgan . 2019. Global Ransomware Damage Costs Predicted To Reach $20 Billion (USD) By 2021 . https:\/\/cybersecurityventures.com\/global-ransomwaredamage-costs-predicted-to-reach-20-billion-usd-by-2021 Access: Oct. 2020. Steve Morgan. 2019. Global Ransomware Damage Costs Predicted To Reach $20 Billion (USD) By 2021. https:\/\/cybersecurityventures.com\/global-ransomwaredamage-costs-predicted-to-reach-20-billion-usd-by-2021 Access: Oct. 2020."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.96"},{"key":"e_1_3_2_2_30_1","volume-title":"Cloak and Dagger: Unpacking Hidden Malware Attacks. https:\/\/www.symantec.com\/blogs\/expert-perspectives\/unpackinghidden-malware-attacks Access","author":"Prasad Balaji","year":"2020","unstructured":"Balaji Prasad . 2016. Cloak and Dagger: Unpacking Hidden Malware Attacks. https:\/\/www.symantec.com\/blogs\/expert-perspectives\/unpackinghidden-malware-attacks Access : Oct. 2020 . Balaji Prasad. 2016. Cloak and Dagger: Unpacking Hidden Malware Attacks. https:\/\/www.symantec.com\/blogs\/expert-perspectives\/unpackinghidden-malware-attacks Access: Oct. 2020."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2017.8170793"},{"key":"e_1_3_2_2_32_1","volume-title":"I am packer and so can you. DEF CON. https:\/\/youtu.be\/ jCIT7rXX8y0 Access","author":"Sconzo Mike","year":"2020","unstructured":"Mike Sconzo . 2015. I am packer and so can you. DEF CON. https:\/\/youtu.be\/ jCIT7rXX8y0 Access : Oct. 2020 . Mike Sconzo. 2015. I am packer and so can you. DEF CON. https:\/\/youtu.be\/ jCIT7rXX8y0 Access: Oct. 2020."},{"key":"e_1_3_2_2_33_1","volume-title":"https:\/\/github.com\/sooshie\/packerid. Access","author":"Sconzo Mike","year":"2020","unstructured":"Mike Sconzo . 2020. Packerid. https:\/\/github.com\/sooshie\/packerid. Access : Oct. 2020 . Mike Sconzo. 2020. Packerid. https:\/\/github.com\/sooshie\/packerid. Access: Oct. 2020."},{"key":"e_1_3_2_2_34_1","volume-title":"Practical Malware Analysis: The Hands-On Guide to Dissecting Malicious Software","author":"Sikorski Michael","unstructured":"Michael Sikorski and Andrew Honig . 2012. Practical Malware Analysis: The Hands-On Guide to Dissecting Malicious Software ( 1 st ed.). No Starch Press, San Francisco, CA, USA . Michael Sikorski and Andrew Honig. 2012. Practical Malware Analysis: The Hands-On Guide to Dissecting Malicious Software (1st ed.). No Starch Press, San Francisco, CA, USA.","edition":"1"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14081-5_23"},{"key":"e_1_3_2_2_36_1","volume-title":"An Incremental DBSCAN approach in Python for real-time monitoring data. https:\/\/github.com\/csymvoul\/Incremental_ DBSCAN. Access","author":"Symvoulidis Chrysostomos","year":"2020","unstructured":"Chrysostomos Symvoulidis . 2020. An Incremental DBSCAN approach in Python for real-time monitoring data. https:\/\/github.com\/csymvoul\/Incremental_ DBSCAN. Access : Oct. 2020 . Chrysostomos Symvoulidis. 2020. An Incremental DBSCAN approach in Python for real-time monitoring data. https:\/\/github.com\/csymvoul\/Incremental_ DBSCAN. Access: Oct. 2020."},{"key":"e_1_3_2_2_37_1","unstructured":"PN Tan M Steinbach and V Kumar. 2006. Chapter 8 Cluster analysis: basic concepts and algorithms. Introduction to data mining 6th edn. Peason Addison Wesley Boston (2006) 486--568.  PN Tan M Steinbach and V Kumar. 2006. Chapter 8 Cluster analysis: basic concepts and algorithms. Introduction to data mining 6th edn. Peason Addison Wesley Boston (2006) 486--568."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.46"},{"key":"e_1_3_2_2_39_1","first-page":"2837","article-title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance","author":"Vinh Nguyen Xuan","year":"2010","unstructured":"Nguyen Xuan Vinh , Julien Epps , and James Bailey . 2010 . Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance . Journal of Machine Learning Research 11 , Oct (2010), 2837 -- 2854 . Nguyen Xuan Vinh, Julien Epps, and James Bailey. 2010. Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. Journal of Machine Learning Research 11, Oct (2010), 2837--2854.","journal-title":"Journal of Machine Learning Research 11"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1186\/s42400-018-0010-y"}],"event":{"name":"CODASPY '21: Eleventh ACM Conference on Data and Application Security and Privacy","location":"Virtual Event USA","acronym":"CODASPY '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the Eleventh ACM Conference on Data and Application Security and Privacy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422337.3447848","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3422337.3447848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:21Z","timestamp":1750197801000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422337.3447848"}},"subtitle":["A Self-Evolving PAcker Classifier against rapid packers evolution"],"short-title":[],"issued":{"date-parts":[[2021,4,26]]},"references-count":40,"alternative-id":["10.1145\/3422337.3447848","10.1145\/3422337"],"URL":"https:\/\/doi.org\/10.1145\/3422337.3447848","relation":{},"subject":[],"published":{"date-parts":[[2021,4,26]]},"assertion":[{"value":"2021-04-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}