签名限制：克隆特征的完整地图及其在近线性时间内的发现
Signature Limits: An Entire Map of Clone Features and their Discovery in Nearly Linear Time
摘要：
我们解决的问题，创建整个和完整的软件代码克隆（复制功能的数据）在语料库中的二进制文物的出处不明的地图。我们报告一个实用的方法，它采用增强的后缀数据结构和部分排序的克隆计算一个紧凑的表示最有趣的克隆功能的数据。当人类探索、测试和验证是成本最高的因素时，克隆功能的枚举对于恶意软件分类和优先级排序非常有用。我们进一步表明，增强阵列可用于发现数据中的出处关系，我们引入了两个不同的Jaccard相似性系数来衡量代码相似性的二进制文物。我们说明了使用这些工具对真正的恶意软件数据，包括追溯实验测量和枚举证据支持共同的出处在{ \it Stuxnet}和{ \it Duqu}。实验结果表明，完全映射数据中的克隆特征是可行和有效的。
英文摘要：
We address the problem of creating entire and complete maps of software code clones (copy features in data) in a corpus of binary artifacts of unknown provenance. We report on a practical methodology, which employs enhanced suffix data structures and partial orderings of clones to compute a compact representation of most interesting clones features in data. The enumeration of clone features is useful for malware triage and prioritization when human exploration, testing and verification is the most costly factor. We further show that the enhanced arrays may be used for discovery of provenance relations in data and we introduce two distinct Jaccard similarity coefficients to measure code similarity in binary artifacts. We illustrate the use of these tools on real malware data including a retro-diction experiment for measuring and enumerating evidence supporting common provenance in {\it Stuxnet} and {\it Duqu}. The results indicate the practicality and efficacy of mapping completely the clone features in data.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
