{"title":"一种有效的API提取方案,用于动态二值相似度比较","authors":"Youngsu Park, Jiman Hong","doi":"10.1145/2513228.2513317","DOIUrl":null,"url":null,"abstract":"Software piracy causes serious problems in many software-related industries. Dynamic binary similarity comparison methods can be used to detect software piracy. However, such methods generate large logs that require long periods of time to perform similarity comparisons. In this paper, we propose an extraction method that facilitates effective binary similarity comparisons. Using the cosine similarity and k-gram similarity, the proposed scheme is shown to be effective for binary similarity comparisons.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"131 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An effective API extraction scheme for dynamic binary similarity comparison\",\"authors\":\"Youngsu Park, Jiman Hong\",\"doi\":\"10.1145/2513228.2513317\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Software piracy causes serious problems in many software-related industries. Dynamic binary similarity comparison methods can be used to detect software piracy. However, such methods generate large logs that require long periods of time to perform similarity comparisons. In this paper, we propose an extraction method that facilitates effective binary similarity comparisons. Using the cosine similarity and k-gram similarity, the proposed scheme is shown to be effective for binary similarity comparisons.\",\"PeriodicalId\":120340,\"journal\":{\"name\":\"Research in Adaptive and Convergent Systems\",\"volume\":\"131 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Research in Adaptive and Convergent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2513228.2513317\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research in Adaptive and Convergent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2513228.2513317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An effective API extraction scheme for dynamic binary similarity comparison
Software piracy causes serious problems in many software-related industries. Dynamic binary similarity comparison methods can be used to detect software piracy. However, such methods generate large logs that require long periods of time to perform similarity comparisons. In this paper, we propose an extraction method that facilitates effective binary similarity comparisons. Using the cosine similarity and k-gram similarity, the proposed scheme is shown to be effective for binary similarity comparisons.